Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NABAVI S.S.; SAFI M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2019 | Volume:16 | Issue:2 (61) Page(s): 77-87

Download Full-Text

Persian Verion

View:

419

Download:

Cites:

Information Journal Paper

Title

Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming

Author(s)

NABAVI S.S. | SAFI M.R. | Issue Writer Certificate

Keywords

Copositive programmingQ1

Genetic algorithmQ1

Particle swarm algorithmQ2

Clique graphQ1

Independent graphQ1

Abstract

In social networks and big size organizations, finding the number of members that all of them have a certain relationship is an important problem for managers, as well the number of members that none of them has not the relationship. Considering the members as vertices and the relationship as edges, and denote the clique number and the number of edges in the Independent graph, respectively. and can be find by solving some optimization models. One of these models is Copositive programming. Unfortunately, there is no any polynomial time algorithm for solving these problems. In this paper, we model these problems as a Copositive programming then solve them using genetic and Particle swarm algorithms. Illustrative examples show the efficiency of our method.

Cites

No record.

References

No record.

Cite

APA: Copy

NABAVI, S.S., & SAFI, M.R.. (2019). Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 16(2 (61) ), 77-87. SID. https://sid.ir/paper/164612/en

Vancouver: Copy

NABAVI S.S., SAFI M.R.. Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2019;16(2 (61) ):77-87. Available from: https://sid.ir/paper/164612/en

IEEE: Copy

S.S. NABAVI, and M.R. SAFI, “Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 16, no. 2 (61) , pp. 77–87, 2019, [Online]. Available: https://sid.ir/paper/164612/en

Related Journal Papers