Home > Research > Publications & Outputs > Strengthened clique-family inequalities for the...

Associated organisational unit

Electronic data

  • clique-family

    Rights statement: This is the author’s version of a work that was accepted for publication in Operations Research Letters. 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 Operations Research Letters, 49, 4, 2021, 586-589 DOI: doi.org/10.1016/j.orl.2021.06.00810.1016/j.orl.2021.06.008

    Accepted author manuscript, 290 KB, PDF document

    Embargo ends: 15/12/22

    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

Strengthened clique-family inequalities for the stable set polytope  

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Strengthened clique-family inequalities for the stable set polytope  . / Letchford, Adam; Ventura, Paolo.

In: Operations Research Letters, Vol. 49, No. 4, 31.07.2021, p. 586-589.

Research output: Contribution to journalJournal articlepeer-review

Harvard

APA

Vancouver

Author

Letchford, Adam ; Ventura, Paolo. / Strengthened clique-family inequalities for the stable set polytope  . In: Operations Research Letters. 2021 ; Vol. 49, No. 4. pp. 586-589.

Bibtex

@article{388921f518a245ef8256a37478c5d6b7,
title = "Strengthened clique-family inequalities for the stable set polytope  ",
abstract = "The stable set polytope is a fundamental object in combinatorial optimisation. Among the many valid inequalities that are known for it, the clique-family inequalities play an important role. Pecher 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.",
keywords = "Combinatorial optimization, Stable set problem, Polyhedral combinatorics",
author = "Adam Letchford and Paolo Ventura",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in Operations Research Letters. 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 Operations Research Letters, 49, 4, 2021, 586-589 DOI: doi.org/10.1016/j.orl.2021.06.00810.1016/j.orl.2021.06.008",
year = "2021",
month = jul,
day = "31",
doi = "10.1016/j.orl.2021.06.008",
language = "English",
volume = "49",
pages = "586--589",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

RIS

TY - JOUR

T1 - Strengthened clique-family inequalities for the stable set polytope  

AU - Letchford, Adam

AU - Ventura, Paolo

N1 - This is the author’s version of a work that was accepted for publication in Operations Research Letters. 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 Operations Research Letters, 49, 4, 2021, 586-589 DOI: doi.org/10.1016/j.orl.2021.06.00810.1016/j.orl.2021.06.008

PY - 2021/7/31

Y1 - 2021/7/31

N2 - The stable set polytope is a fundamental object in combinatorial optimisation. Among the many valid inequalities that are known for it, the clique-family inequalities play an important role. Pecher 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.

AB - The stable set polytope is a fundamental object in combinatorial optimisation. Among the many valid inequalities that are known for it, the clique-family inequalities play an important role. Pecher 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.

KW - Combinatorial optimization

KW - Stable set problem

KW - Polyhedral combinatorics

U2 - 10.1016/j.orl.2021.06.008

DO - 10.1016/j.orl.2021.06.008

M3 - Journal article

VL - 49

SP - 586

EP - 589

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -