Strengthening Chvátal-Gomory cuts for the stable set problem

Letchford, Adam Nicholas and Marzi, Francesca and Rossi, Fabrizio and Smriglio, Stefano (2016) Strengthening Chvátal-Gomory cuts for the stable set problem. In: Combinatorial Optimization. Lecture Notes in Computer Science . Springer, Berlin, pp. 201-212. ISBN 9783319455860

PDF (isco-stable-set)
isco_stable_set.pdf - Accepted Version

Download (271kB)


The stable set problem is a well-known NP-hard combinatorial optimization problem. As well as being hard to solve (or even approximate) in theory, it is often hard to solve in practice. The main difficulty is that upper bounds based on linear programming (LP) tend to be weak, whereas upper bounds based on semidefinite programming (SDP) take a long time to compute. We propose a new method to strengthen the LP-based upper bounds. The key idea is to take violated Chvátal-Gomory cuts and then strengthen their right-hand sides. Although the strengthening problem is itself NP-hard, it can be solved reasonably quickly in practice. As a result, the overall procedure proves to be capable of yielding competitive upper bounds in reasonable computing times.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
27 May 2016 12:58
Last Modified:
15 Sep 2023 04:55