Strengthened clique-family inequalities for the stable set polytope

The stable set polytope is a fundamental object in combinatorial optimization. Among the many valid inequalities that are known for it, the clique-family inequalities play an important role. Pêcher and Wagler showed that the clique-family inequalities can be strengthened under certain conditions. We...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 49; no. 4; pp. 586 - 589
Main Authors Letchford, Adam N., Ventura, Paolo
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.07.2021
Subjects
Combinatorial optimization
Polyhedral combinatorics
Stable set problem
Polyhedral combinatorics
Combinatorial optimization
Stable set problem
Online AccessGet full text

Cover

More Information
Summary:The stable set polytope is a fundamental object in combinatorial optimization. Among the many valid inequalities that are known for it, the clique-family inequalities play an important role. Pêcher and Wagler showed that the clique-family inequalities can be strengthened under certain conditions. We show that they can be strengthened even further, using a surprisingly simple mixed-integer rounding argument.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2021.06.008