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
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (937kB)

Official URL: https://doi.org/10.1016/j.cor.2020.105024

Abstract

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

Additional Information:

This is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 123, 2020 DOI: 10.1016/j.cor.2020.105024

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/asjc/1700

Subjects:

Departments:

Lancaster University Management School > Management Science

ID Code:

144569

Deposited By:

ep_importer_pure

Deposited On:

11 Jun 2020 08:58

Refereed?: