A Branch and Cut solver for the maximum stable set problem

  title={A Branch and Cut solver for the maximum stable set problem},
  author={Steffen Rebennack and Marcus Oswald and Dirk Oliver Theis and Hanna Seitz and Gerhard Reinelt and Panos M. Pardalos},
  journal={J. Comb. Optim.},
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 23 extracted citations

Polylithic modeling and solution approaches using algebraic modeling systems

Optimization Letters • 2011
View 1 Excerpt
Highly Influenced

Analysis of some cutting plane algorithms of integer programming

2016 Dynamics of Systems, Mechanisms and Machines (Dynamics) • 2016
View 1 Excerpt

Combinatorial Optimization

Lecture Notes in Computer Science • 2016
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 18 references

Computational Experience with Stable Set Relaxations

SIAM Journal on Optimization • 2003
View 3 Excerpts
Highly Influenced

A BranchandCut Algorithm for the Maximum Cardinality Stable Set Problem

Stefano Smriglio
Operations Research Letters • 2008

Encyclopedia of Optimization, pages 3676–3688

Pardalos, editors

Branch - andCut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS

Matthias Elf, Carsten Gutwenger, Michael Jnger
Math . Prog . B • 2007

Similar Papers

Loading similar papers…