RT - Journal Article
T1 - Finding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming
JF - JAMLU
YR - 2019
JO - JAMLU
VO - 16
IS - 2
UR - http://jamlu.liau.ac.ir/article-1-1706-en.html
SP - 77
EP - 87
K1 - Copositive programming
K1 - Genetic algorithm
K1 - Particle swarm algorithm
K1 - Clique graph
K1 - Independent graph.
AB - 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.
LA eng
UL http://jamlu.liau.ac.ir/article-1-1706-en.html
M3
ER -