Volume 16, Issue 2 (7-2019)                   jor 2019, 16(2): 77-87 | Back to browse issues page

XML Persian Abstract Print

Department of Mathematics, Statistics and Computer Science, Semnan University, Semnan
Abstract:   (1917 Views)
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.
Full-Text [PDF 712 kb]   (503 Downloads)    
Type of Study: Applicable | Subject: Special
Received: 2018/07/2 | Accepted: 2019/05/17 | Published: 2019/07/15

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.