Geodesic
On solving the clique problem via the d.\,c.~constraint problem
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 6, pp. 20-33

Voir la notice de l'article provenant de la source Math-Net.Ru

The Maximum Weighted Clique Problem (MWCP) and the Maximum Clique Problem (MCP) are considered as continuous (nonconvex) problems with constraint given by the (d. c.) function which can be represented as the difference of two convex functions. For solving MWCP and MCP the Global Search Strategy is applied, that is the base of a heuristic algorithm. Each step of the algorithm is investigated. The computational effectiveness of this approach is illustrated in comparison with other approaches. Tabl. 4, bibl. 12.
Mots-clés : maximum clique
Keywords: local search procedure, d. c. programming, global search algorithm. 
@article{DA_2008_15_6_a2,
     author = {T. V. Gruzdeva},
     title = {On solving the clique problem via the d.\,c.~constraint problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {20--33},
     publisher = {mathdoc},
     volume = {15},
     number = {6},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_6_a2/}
}
TY  - JOUR
AU  - T. V. Gruzdeva
TI  - On solving the clique problem via the d.\,c.~constraint problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 20
EP  - 33
VL  - 15
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_6_a2/
LA  - ru
ID  - DA_2008_15_6_a2
ER  - 
%0 Journal Article
%A T. V. Gruzdeva
%T On solving the clique problem via the d.\,c.~constraint problem
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 20-33
%V 15
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_6_a2/
%G ru
%F DA_2008_15_6_a2
T. V. Gruzdeva. On solving the clique problem via the d.\,c.~constraint problem. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 6, pp. 20-33. http://geodesic.mathdoc.fr/item/DA_2008_15_6_a2/