Home > Research > Publications & Outputs > The stable set problem

Associated organisational unit

Electronic data

  • nodal

    Rights statement: 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

    Accepted author manuscript, 915 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

The stable set problem: clique and nodal inequalities revisited

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
Article number105024
<mark>Journal publication date</mark>30/11/2020
<mark>Journal</mark>Computers and Operations Research
Volume123
Number of pages16
Publication StatusPublished
Early online date17/06/20
<mark>Original language</mark>English

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.

Bibliographic note

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