The stable set problem:clique and nodal inequalities revisited

Letchford, Adam and Rossi, Fabrizio and Smriglio, Stefano (2020) The stable set problem:clique and nodal inequalities revisited. Computers and Operations Research, 123. ISSN 0305-0548

Text (nodal)
nodal.pdf - Accepted Version
Restricted to Repository staff only until 1 January 2050.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (937kB)


The stable set problem is a fundamental combinatorial optimisation problem, that is known to be very difficult in both theory and practice. Some of the solution algorithms in the literature are based on 0-1 linear programming formulations. We examine an entire family of such formulations, based on so-called clique and nodal inequalities. As well as proving some theoretical results, we conduct extensive computational experiments. This enables us to derive guidelines on how to choose the right formulation for a given instance.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
11 Jun 2020 08:58
Last Modified:
17 Jan 2021 09:51