Computing the stability number of a graph via linear and semidefinite programming

SIAM Journal on Optimization

Volumn 18, Issue 1, 2007, Pages 87-105

  Peña, Javier ^a   Vera, Juan ^b   Zuluaga, Luis F ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Copositivity; Lifting procedures; Polynomials; Stability number

Indexed keywords

COPOSITIVITY; LIFTING PROCEDURES; SEMIDEFINITE PROGRAMMING; STABILITY NUMBER;

APPROXIMATION THEORY; LINEAR PROGRAMMING; NUMBER THEORY; POLYNOMIALS;

GRAPH THEORY;

EID: 39449110450     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/05064401X     Document Type: Article

References (17)

1. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Program., 58 (1993), pp. 295-324.
2. I. BOMZE, M. BUDINICH, P. PARDALOS, AND M. PELILLO, The Maximum Clique Problem, in Handb. Combin. Opt., Suppl. A, D. Du and P. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1999.
3. I. BOMZE AND E. DE KLERK, Solving standard quadratic optimization problems via semidefinite and copositive programming, J. Global Optim., 24 (2002), pp. 163-185.
4. E. DE KLERK AND D. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
5. P. DIANANDA, On non-negative forms in real variables some or all of which are non-negative, Math. Proc. Cambridge Philos. Soc., 58 (1962), pp. 17-25.
6. N. GVOZDENOVIĆ AND M. LAURENT, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 3509/2005, Springer, Berlin, 2005, pp. 136-151.
7. 1-ε|, Acta Math., 182 (1999), pp. 105-142.
8. D. HOCHBAUM (ed), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1998.
9. J. LASSERRE, Global optimization problems with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
10. J. LASSERRE, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J. Optim., 12 (2002), pp. 756-769.
11. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
12. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
13. K. MURTY AND S. KABADI, Some NP-complete problems in quadratic and linear programming, Math. Program., 39 (1987), pp. 117-129.
14. P. PARRILO, Structured Semidefinite Programming and Algebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 2000.
15. A. SCHRIJVER, A comparison of Delsarte and Lovász bounds, IEEE Trans. Inform. Theory, 25 (1979), pp. 425-429.
16. J. STURM, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Methods Softw., 11-12 (1999), pp. 545-581.
17. L. ZULUAGA, J. VERA, AND J. PEÑA, LMI approximations for cones of positive semidefinite forms, SIAM J. Optim., 16 (2006), 1076-1091.