TY - JOUR
T1 - Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming
TT - یافتن تعداد افراد با شرایط خاص در شبکه های اجتماعی و سازمان های بزرگ با استفاده از برنامه ریزی هم مثبت
JF - JAMLU
JO - JAMLU
VL - 16
IS - 2
UR - http://jamlu.liau.ac.ir/article-1-1706-en.html
Y1 - 2019
SP - 77
EP - 87
KW - Copositive programming
KW - Genetic algorithm
KW - Particle swarm algorithm
KW - Clique graph
KW - Independent graph.
N2 - In social networks and big size organizations, finding the number of members that all of them have a certain relationship w* is an important problem for managers, as well the number of members that none of them has not the relationship (w*). Considering the members as vertices and the relationship as edges, w* and w* denote the clique number and the number of edges in the independent graph, respectively. w*and w* 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.
M3
ER -