| Article ID: | iaor2006319 |
| Country: | Netherlands |
| Volume: | 28 |
| Issue: | 2 |
| Start Page Number: | 63 |
| End Page Number: | 74 |
| Publication Date: | Mar 2001 |
| Journal: | Operations Research Letters |
| Authors: | Rossi F., Smriglio S. |
| Keywords: | programming: branch and bound, sets |
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 experiment on the DIMACS benchmark graphs validates the effectiveness of the approach.