Abstract
A new exact approach to the stable set problem is presented, which attempts to avoids the pitfalls of existing approaches based on linear and semidefinite programming. The method begins by constructing an ellipsoid that contains the stable set polytope and has the property that the upper bound obtained by optimising over it is equal to the Lovász theta number. This ellipsoid is then used to derive cutting planes, which can be used within a linear programming-based branch-and-cut algorithm. Preliminary computational results indicate that the cutting planes are strong and easy to generate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpen-Adria-Universität Klagenfurt website, http://www.math.uni-klu.ac.at/or/Software
Andersen, K., Pochet, Y.: Coefficient strengthening: a tool for reformulating mixed-integer programs. Math. Program. 122, 121–154 (2009)
Balas, E., Ceria, S., Cornuéjols, G., Pataki, G.: Polyhedral methods for the maximum clique problem. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 11–28 (1996)
R.: Borndörfer, Aspects of Set Packing, Partitioning and Covering. Doctoral Thesis, Technical University of Berlin (1998)
DIMACS Repository, ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique
Dukanovic, I., Rendl, F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program 109, 345–365 (2007)
Fahle, T.: Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 47–86. Springer, Heidelberg (2002)
Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Glob. Opt. 10, 367–380 (1997)
Fujie, T., Tamura, A.: On Grötschel-Lovász-Schrijver’s relaxation of stable set polytopes. J. Oper. Res. Soc. Japan 45, 285–292 (2002)
Giandomenico, M., Letchford, A.N.: Exploring the relationship between max-cut and stable set relaxations. Math. Program 106, 159–175 (2006)
Grötschel, M., Lovász, L., Schrijver, A.J.: Geometric Algorithms in Combinatorial Optimization. Wiley, New York (1988)
Gruber, G., Rendl, F.: Computational experience with stable set relaxations. SIAM J. Opt. 13, 1014–1028 (2003)
Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring and Satisfiability: the 2nd DIMACS Implementation Challenge. American Mathematical Society, Providence
Håstad, J.: Clique is hard to approximate within n 1 − ε. Acta Math. 182, 105–142 (1999)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)
Lemaréchal, C., Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Hadjisawas, N., Pardalos, P.M. (eds.) Advances in Convex Analysis and Global Optimization. Kluwer, Dortrecht (2001)
Lovász, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Th. IT-25, 1–7 (1979)
Lovász, L., Schrijver, A.J.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1, 166–190 (1991)
Malick, J., Povh, J., Rendl, F., Wiegele, A. (2007) Boundary Point Method for solving SDPs: mprw.m, Inst. f. Mathematik, Alpen-Adria-Universität Klagenfurt (2007)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5, 199–215 (1973)
Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Opt. 7, 51–73 (1995)
Rebennack, S., Oswald, M., Theis, D.O., Seitz, H., Reinelt, G., Pardalos, P.M.: A branch and cut solver for the maximum stable set problem. J. Comb. Opt. (2010) (to appear)
Régin, J.-C.: Solving the maximum clique problem with constraint programming. In: Proceedings of CPAIOR 2003. LNCS, vol. 2883, pp. 634–648. Springer, Heidelberg (2003)
Rossi, F., Smriglio, S.: A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett. 28, 63–74 (2001)
Schrijver, A.J.: A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inf. Th. IT-25, 425–429 (1979)
Tunçel, L.: On the Slater condition for SDP relaxations of nonconvex sets. Oper. Res. Lett. 29, 181–186 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giandomenico, M., Letchford, A.N., Rossi, F., Smriglio, S. (2011). A New Approach to the Stable Set Problem Based on Ellipsoids. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)