A new trust region technique for the maximum weight clique problem

Discrete Applied Mathematics

Volumn 154, Issue 15, 2006, Pages 2080-2096

  Busygin, Stanislav ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Heuristic; Maximum weight cliquel; Motzkin Straus theorem; Quadratic programming; Trust region

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

MAXIMUM WEIGHT CLIQUEL; MOTZKIN-STRAUS THEOREM; STATIONARY POINTS; TRUST REGION;

THEOREM PROVING;

EID: 33746894163     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.04.010     Document Type: Article

References (23)

1. Abello J., Butenko S., Pardalos P.M., and Resende M.G.C. Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Global Optim. 21 4 (2001) 111-137
2. Bomze I.M., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (Supplement Volume A) (1999), Kluwer Academic, Dordrecht 1-74
3. Brent R.P. Algorithms for Minimization without Derivatives (1973), Prentice-Hall, Englewood Cliffs, NJ
4. M. Brockington, J.C. Culberson, Camouflaging independent sets in quasi-random graphs, in: D. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, AMS, Providence, RI, 1996, pp. 75-88.
5. Burer S., Monteiro R.D.C., and Zhang Y. Maximum stable set formulations and heuristics based on continuous optimization. Math. Program. 94 1 (2002) 137-166
6. S. Busygin, Stas Busygin's NP-completeness page, 〈http://www.busygin.dp.ua/npc.html〉.
7. Busygin S., Butenko S., and Pardalos P.M. A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J. Combin. Optim. 6 3 (2002) 287-297
8. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem, Computer Science Division Technical Report No. UCB//CSD-97-971, UC Berkeley, 1997.
9. Forsythe G.E., and Golub G.H. On the stationary values of a second degree polynomial on the unit sphere. SIAM J. Appl. Math. 13 (1965) 1050-1068
10. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman & Co., New York
11. Gibbons L.E., Hearn D.W., Pardalos P.M., and Ramana M.V. Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22 (1997) 754-768
12. Hager W. Minimizing a quadratic over a sphere. SIAM J. Optim. 12 (2001) 188-208
13. 1 - ε{lunate}, in: Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 1996, pp. 627-636.
14. S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001, pp. 600-609.
15. Lyle S., and Szularz M. Local minima of the trust region problem. J. Optim. Theory Appl. 80 (1994) 117-134
16. Mannino C., and Stefanutti E. An augmentation algorithm for the maximum weighted stable set problem. Comput. Optim. Appl. 14 (1999) 367-381
17. Massaro A., Pelillo M., and Bomze I.M. A complementary pivoting approach to the maximum weight clique problem. SIAM J. Optim. 12 4 (2001) 928-948
18. B.D. McKay, The nauty page, 〈http://cs.anu.edu.au/∼bdm/nauty/〉.
19. Moré J.J., and Sorensen D.S. Computing a trust region step. SIAM J. Sci. Statist. Comput. 4 (1983) 553-572
20. Motzkin T.S., and Straus E.G. Maxima for graphs and a new proof of a theorem of Turan. Canad. J. Math. 17 4 (1965) 533-540
21. V.Y. Pan, Z.Q. Chen, The complexity of the matrix eigenproblem, in: The 21st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, ACM Press, New York, 1999, pp. 507-516.
22. P. St-Louis, J.A. Ferland, B. Gendron, 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,
23. Ye Y. A new complexity result on minimization of a quadratic function with a sphere constraint. Recent Advances in Global Optimization (1992), Princeton University Press, Princeton 19-31