Abstract
This paper is focused on computational study of continuous approach for the maximum weighted clique problem. The problem is formulated as a continuous optimization problem with a nonconvex quadratic constraint given by the difference of two convex functions (d.c. function). The proposed approach consists of two main ingredients: a local search algorithm, which provides us with crucial points; and a procedure which is based on global optimality condition and which allows us to escape from such points. The efficiency of the proposed algorithm is illustrated by computational results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garey M., Johnson D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)
Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem, handbook of combinatorial optimization. Supplement A, 1–74 (1999)
Pardalos P.M., Xue J.: The maximum clique problem. J. Glob. Optim. 4, 301–328 (1994)
St-Louis, P., Ferland, J.A., Gendron, B.: A penalty-evaporation heuristic in a decomposition method for the maximum clique problem, Techinical Report, Départment d‘ informatique et de recherche operationnelle, Université de Montréal, http://www.iro.umontreal.ca/~gendron/publi.html
Mannino C., Stefanutti E.: An augmentation algorithm for the maximum weighted stable set problem. Comput. Optim. Appl. 14, 367–381 (1999)
Massaro A., Pelillo M., Bomze I.M.: A complementary pivoting approach to the maximum weight clique problem. SIAM J. Optim. 12(4), 928–948 (2001)
Bomze I.M., Grippo L., Palagi L. Unconstrained formulation of standard quadratic optimization problems, to appear in TOP. http://www.springerlink.com/content/u28x81703t671p77/
Kuznetsova A.A., Strekalovsky A.S.: On solving the maximum clique problem. J. Glob. Optim. 21(3), 265–288 (2001)
Bomze I.M.: Evolution towards the maximum clique. J. Glob. Optim. 10, 143–164 (1997)
Burer S., Monteiro R.D.C., Zhang Y.: Maximum stable set formulations and heuristics based on continuous optimization. Math. Program. 94(1), 137–166 (2002)
Busygin S.: A new trust region technique for the maximum weight clique problem. Discret. Appl. Math. 154(15), 2080–2096 (2006)
Busygin, S.: QualexMS: QUick ALmost EXact maximum weight clique solver based on a generalized Motzkin-Straus formulation, ver 1.2, Stas Busygin’s Home page, http://www.stasbusygin.org/ (2007)
Motzkin T.S., Straus E.G.: Maxima for graphs and a new proof of a theorem of Turán Canad. J. Math. 17, 533–540 (1965)
Horst R., Thoai N.V.: D.C. programming: overview. J. Optim. Theory Appl. 103(1), 1–43 (1999)
Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 2nd revised edn. Springer, Berlin (1993)
Strekalovsky A.S.: Extremal problems with D.C.-constraints. Comput. Math. Math. Phys. 41, 1742–1751 (2001)
Strekalovsky A.S.: Minimizing sequences in problems with d.c. constraints. Comput. Math. Math. Phys. 45, 418–429 (2005)
Gruzdeva T.V., Strekalovsky A.S.: Local search in problems with nonconvex constraints. Comput. Math. Math. Phys. 47, 381–396 (2007)
Blanquero R., Carrizosa E.: On the norm of a dc function. J. Glob. Optim. 48, 209–213 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gruzdeva, T.V. On a continuous approach for the maximum weighted clique problem. J Glob Optim 56, 971–981 (2013). https://doi.org/10.1007/s10898-012-9885-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-012-9885-4