A Branch and Cut solver for the maximum stable set Problem

Journal of Combinatorial Optimization

Volumn 21, Issue 4, 2011, Pages 434-457

  Rebennack, Steffen ^a   Oswald, Marcus ^b,c   Theis, Dirk Oliver ^c   Seitz, Hanna ^b   Reinelt, Gerhard ^b   Pardalos, Panos M ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^b UNIVERSITY OF HEIDELBERG   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; CUTTING-PLANE APPROACH; MAXIMUM STABLE SET; SEPARATION METHODS; SEPARATION TOOLS; THEORETICAL RESULT;

LINEAR PROGRAMMING;

EID: 78650648546     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9264-3     Document Type: Article

References (32)

1. ABACUS (2006) A branch and cut solver. Version 2.3.0. http://www.informatik.uni-koeln.de/abacus/.
2. 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.
3. 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.
4. Avenali A (2007) Resolution branch and bound and an application: the maximum weighted stable set problem. Oper Res 55(5):932-948. (Pubitemid 351159539)
5. Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 14(4):1054-1068. (Pubitemid 17465854)
6. Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. Handbook of combinatorial optimization. Kluwer Academic, Boston.
7. Butenko S (2003) Maximum independent set and related problems, with applications. PhD thesis, University of Florida, USA.
8. 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.
9. Caprara A, Fiscetti M, Letchford AN (2000) On the separation of maximally violated mod-k cuts. Math Program 87(1):37-56.
10. de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284-309. (Pubitemid 39042722)
11. Dukanovich I, Rendl F (2007) Semidefinite programming relaxations for graph coloring and maximal clique problems. Math Prog B 109:345-365. (Pubitemid 46197860)
12. 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. (Pubitemid 33369829)
13. Fricke L (2007).
14. 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.
15. 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.
16. Gerards AMH, Schrijver A (1986) Matrices with the Edmonds-Johnson property. Combinatorica 6:365- 379.
17. Grötschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combiantorial optimization. Springer, Berlin.
18. Gruber G, Rendl F (2003) Computational experience with stable set relaxations. SIAM J Opt 13:1014- 1028. (Pubitemid 37395684)
19. ILOG CPLEX, Version 8.100. http://www.ilog.com/products/cplex/.
20. 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.
21. Nemhauser GL, Sigismondi G (1992) A strong cutting plane/branch-and-bound algorithm for node packing. J Oper Res Soc 43:443-457.
22. Nemhauser GL, Trotter LE Jr (1975) Vertex packings: structural properties and algorithms. Math Program 8:232-248.
23. Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199-215.
24. Rebennack S (2006) Maximum stable set problem: a branch & cut solver. Diplomarbeit, Ruprecht-Karls Universität Heidelberg, Heidelberg, Germany.
25. 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.
26. Rossi F, Smriglio S (2001) A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper Res Lett 28:63-74. (Pubitemid 32264929)
27. Second DIMACS Challenge (1992/1993). http://mat.gsia.cmu.edu/challenge. html.
28. Sewell EC (1998) A branch and bound algorithm for the stability number of a sparse graph. INFORMS J Comput 10(4):438-447. (Pubitemid 128669149)
29. Strickland DM, Barnes E, Sokol JS (2005) Optimal protein structure alignment using maximum cliques. Oper Res 53:389-402. (Pubitemid 41342344)
30. 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.
31. Warrier D (2007) A branch, price, and cut appraoch to solving the maximum weighted independent set problem. PhD thesis, Texas A&M University.
32. 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. (Pubitemid 43082154)