Computational experience with stable set relaxations

SIAM Journal on Optimization

Volumn 13, Issue 4, 2003, Pages 1014-1028

  Gruber, Gerald ^a   Rendl, Franz ^b  

^a Carinthia Tech Institute   (Austria)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Semidefinite programming; Stable set problem; Theta function

Indexed keywords

EID: 0242511176     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401394092     Document Type: Article

References (27)

1. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Programming, 58 (1993), pp. 295-324.
2. F. BARAHONA, On cuts and matchings in planar graphs, Math. Programming, 36 (1993), pp. 53-68.
3. I. M. BOMZE, M. PELILLO, AND R. GIACOMINI, Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale, in Developments in Global Optimization, I. M. Bomze, T. Csendes, R. Horst, and P. M. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997, pp. 95-108.
4. V. CHVÁTAL, On certain polytopes associated with graphs, J. Combin. Theory Ser. B, 18 (1975), pp. 138-154.
5. D. R. FULKERSON, On the perfect graph theorem, in Mathematical Programming, T. C. Hu and S. M. Robinson, eds., Academic Press, New York, 1973, pp. 69-76.
6. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
7. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Relaxations of vertex packing, J. Combin. Theory Ser. B, 40 (1986), pp. 330-343.
8. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988.
9. G. GRUBER, On Semidefinite Programming and Applications in Combinatorial Optimization, Ph.D. thesis, University of Technology, Graz, Austria, Shaker Verlag, Aachen, Germany, Maastricht, The Netherlands, 2000.
10. J. HASSELBERG, P. M. PARDALOS, AND G. VAIRAKTARAKIS, Test case generators and computational results for the maximum clique problem, J. Global Optim., 3 (1993), pp. 463-482.
11. C. HELMBERG, S. POLJAK, F. RENDL, AND H. WOLKOWICZ, Combining semidefinite and polyhedral relaxations for integer programs, in Integer Programming and Combinatorial Optimization (Proceedings of the 4th International IPCO Conference, Copenhagen, Denmark, 1995), Lecture Notes in Comput. Sci. 920, E. Balas and J. Clausen, eds., Springer-Verlag, Berlin, 1995, pp. 124-134.
12. C. HELMBERG, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
13. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86125.
14. M. LAURENT, A Comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre Relaxations for 0-1 Programming, Technical report, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 2001.
15. M. LAURENT, S. POLJAK, AND F. RENDL, Connections between semidefinite relaxations of the max-cut and stable set problems, Math. Programming, 77 (1997), pp. 225-246.
16. C. LEMARÉCHAL AND F. OUSTRY, Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization, Technical report, Institut National de Recherche en Informatique et en Automatique (INRIA), St. Martin, France, 1999.
17. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
18. L. LOVÁSZ, Semidefinite Programs and Combinatorial Optimization, lecture notes, 1995.
19. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
20. C. MANNINO AND A. SASSANO, Edge projection and the maximum cardinality stable set problem, in Cliques, Coloring, and Satisfiability, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 26, D. S. Johnson and M. A. Trick, eds., AMS, Providence, RI, 1996, pp. 205-219.
21. R. D. C. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
22. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
23. S. POLJAK, F. RENDL, AND H. WOLKOWICZ, A recipe for semidefinite relaxation for (0, 1)-quadratic programming, J. Global Optim., 7 (1995), pp. 51-73.
24. L. A. SANCHIS, Test case construction for the vertex cover problem, in Computational Support for Discrete Mathematics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 15, AMS, Providence, RI, 1994, pp. 1052-1798.
25. A. SCHRIJVER, A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory, 25 (1979), pp. 425-429.
26. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
27. C. DE SIMONE, The cut polytope and the Boolean quadric polytope, Discrete Math., 79 (1989), pp. 71-75.