A Branch and Cut solver for the maximum stable set problem

Steffen Rebennack (), Marcus Oswald (), Dirk Oliver Theis (), Hanna Seitz (), Gerhard Reinelt () and Panos M. Pardalos ()
Additional contact information
Steffen Rebennack: University of Florida
Marcus Oswald: Ruprecht-Karls Universität Heidelberg
Dirk Oliver Theis: OvG-Universität Magdeburg
Hanna Seitz: Ruprecht-Karls Universität Heidelberg
Gerhard Reinelt: Ruprecht-Karls Universität Heidelberg
Panos M. Pardalos: University of Florida

Journal of Combinatorial Optimization, 2011, vol. 21, issue 4, No 4, 434-457

Abstract: Abstract 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.

Keywords: Maximum stable set problem; Cutting-plane algorithm; Branch and Cut; Separation algorithm; Edge-projection (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9264-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:21:y:2011:i:4:d:10.1007_s10878-009-9264-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9264-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().