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.
|Titolo:||The stable set problem: Clique and nodal inequalities revisited|
|Data di pubblicazione:||2020|
|Appare nelle tipologie:||1.1 Articolo in rivista|