This paper deals with the cutting-plane approach to the maximum stable set problem. We provide theoretical results regarding the facet-defining property of inequalities obtained by a known project-and-lift-style separation method called edge-projection, and its variants. An implementation of a Branch and Cut algorithm is described, which uses edge-projection and two other separation tools which have been discussed for other problems: local cuts (pioneered by Applegate, Bixby, Chvátal and Cook) and mod-k cuts. We compare the performance of this approach to another one by Rossi and Smiriglio (Oper. Res. Lett. 28:63–74, 2001) and discuss the value of the tools we have tested.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
ABACUS (2006) A branch and cut solver. Version 2.3.0. http://www.informatik.uni-koeln.de/abacus/
Applegate D, Bixby R, Chvátal V, Cook W (2001) TSP cuts which do not conform to the template paradigm. In: Computational combinatorial optimization. LNCS, vol 2241. Springer, Berlin, pp 157–222
Arora S, Safra S (1992) Probabilistic checking of proofs; a new characterization of NP. In: Proceedings 33rd IEEE symposium on foundations of computer science. IEEE Computer Society, Los Angeles, pp 2–13
Avenali A (2007) Resolution branch and bound and an application: the maximum weighted stable set problem. Oper Res 55(5):932–948
Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 14(4):1054–1068
Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. Handbook of combinatorial optimization. Kluwer Academic, Boston
Butenko S (2003) Maximum independent set and related problems, with applications. PhD thesis, University of Florida, USA
Campelo M, Correa RC (2009) A Lagrangian relaxation for the maximum stable set problem. http://arxiv.org/PS_cache/arxiv/pdf/0903/0903.1407v1.pdf
Caprara A, Fiscetti M, Letchford AN (2000) On the separation of maximally violated mod-k cuts. Math Program 87(1):37–56
de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284–309
Dukanovich I, Rendl F (2007) Semidefinite programming relaxations for graph coloring and maximal clique problems. Math Prog B 109:345–365
Elf M, Gutwenger C, Jünger M, Rinaldi G (2001) Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS. In: Computational combinatorial optimization. LNCS, vol 2241. Springer, Berlin, pp 157–222
Fricke L (2007)
Fujisawa K, Morito S, Kubo M (1995) Experimental analyses of the life span method for the maximum stable set problem. Inst Stat Math Coop Res Rep 75:135–165
Garey MR, Johnson DS (1979) In: Klee V (ed) Computers and intractability, a guide to the theory of NP-completeness. A series of books in the mathematical sciences. Freeman, New York
Gerards AMH, Schrijver A (1986) Matrices with the Edmonds-Johnson property. Combinatorica 6:365–379
Grötschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combiantorial optimization. Springer, Berlin
Gruber G, Rendl F (2003) Computational experience with stable set relaxations. SIAM J Opt 13:1014–1028
ILOG CPLEX, Version 8.100. http://www.ilog.com/products/cplex/
Mannino C, Sassano A (1996) Edge projection and the maximum cardinality stable set problem. In: DIMACS series in discrete mathematics and theoretical computer science, vol 26. AMS, New York, pp 249–261
Nemhauser GL, Sigismondi G (1992) A strong cutting plane/branch-and-bound algorithm for node packing. J Oper Res Soc 43:443–457
Nemhauser GL, Trotter LE Jr (1975) Vertex packings: structural properties and algorithms. Math Program 8:232–248
Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199–215
Rebennack S (2006) Maximum stable set problem: a branch & cut solver. Diplomarbeit, Ruprecht–Karls Universität Heidelberg, Heidelberg, Germany
Rebennack S (2008) Stable set problem: branch & cut algorithms. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization, 2nd edn. Springer, Berlin, pp 3676–3688
Rossi F, Smriglio S (2001) A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper Res Lett 28:63–74
Second DIMACS Challenge (1992/1993). http://mat.gsia.cmu.edu/challenge.html
Sewell EC (1998) A branch and bound algorithm for the stability number of a sparse graph. INFORMS J Comput 10(4):438–447
Strickland DM, Barnes E, Sokol JS (2005) Optimal protein structure alignment using maximum cliques. Oper Res 53:389–402
Warren JS, Hicks IV (2006) Combinatorial branch-and-bound for the maximum weight independent set problem. http://ie.tamu.edu/people/faculty/Hicks/jeff.rev.pdf
Warrier D (2007) A branch, price, and cut appraoch to solving the maximum weighted independent set problem. PhD thesis, Texas A&M University
Warrier D, Wilhelm WE, Warren JS, Hicks IV (2005) A branch-and-price approach for the maximum weight independent set proble. Networks 46(4):198–209
Panos M. Pardalos is partially supported by Airfoce and DTRA grants.
About this article
Cite this article
Rebennack, S., Oswald, M., Theis, D.O. et al. A Branch and Cut solver for the maximum stable set problem. J Comb Optim 21, 434–457 (2011). https://doi.org/10.1007/s10878-009-9264-3
- Maximum stable set problem
- Cutting-plane algorithm
- Branch and Cut
- Separation algorithm