A branch-and-cut algorithm for the maximum cardinality stable set problem

Authors:
F Rossi;S Smriglio
Affiliations:
Dipartimento di Matematica Pura ed Applicata, Universití di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), Italy;Dipartimento di Matematica Pura ed Applicata, Universití di L'Aquila, Via Vetoio, 67010 Coppito (L'Aquila), Italy
Venue:
Operations Research Letters
Year:
2001

Citing 7
Cited 5

Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
Habitat dispersion in forest planning and the stable set problem

Operations Research - Supplement
Solving airline crew scheduling problems by branch-and-cut

Management Science
Compositions of Graphs and Polyhedra II: Stable Sets

SIAM Journal on Discrete Mathematics
An exact algorithm for the maximum stable set problem

Computational Optimization and Applications
Separating lifted odd-hole inequalities to solve the index selection problem

Discrete Applied Mathematics
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph

INFORMS Journal on Computing

A branch-and-cut algorithm for the pallet loading problem

Computers and Operations Research
An exact approach to the problem of extracting an embedded network matrix

Computers and Operations Research
A Branch and Cut solver for the maximum stable set problem

Journal of Combinatorial Optimization
A new approach to the stable set problem based on ellipsoids

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
The maximum common edge subgraph problem: A polyhedral investigation

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem. Rank constraints of general structure are generated by executing clique separation algorithms on a modified graph obtained with edge projections. A branching scheme exploiting the available inequalities is also introduced. A computational experience on the DIMACS benchmark graphs validates the effectiveness of the approach.