Home > Research > Publications & Outputs > On lifted cover inequalities

Electronic data

  • lifted-cover-ineqs

    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, 47, 2, 2019 DOI: 10.1016/j.orl.2018.12.005

    Accepted author manuscript, 303 KB, PDF document

    Embargo ends: 28/06/20

    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

On lifted cover inequalities: a new lifting procedure with unusual properties

Research output: Contribution to journalJournal article

Published

Standard

On lifted cover inequalities : a new lifting procedure with unusual properties. / Letchford, Adam Nicholas; Souli, Georgia.

In: Operations Research Letters, Vol. 47, No. 2, 17.01.2019, p. 83-88.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Bibtex

@article{25fe25727d7740909e400cff2dfc83bb,
title = "On lifted cover inequalities: a new lifting procedure with unusual properties",
abstract = "Lifted cover inequalities are well-known cutting planes for 0-1 linear programs. We show how one of the earliest lifting procedures, due to Balas, can be significantly improved. The resulting procedure has some unusual properties. For example, (i) it can yield facet-defining inequalities even if the given cover is not minimal, (ii) it can yield facet-defining inequalities that cannot be obtained by standard lifting procedures, and (iii) the associated superadditive lifting function isinteger-valued almost everywhere.",
keywords = "integer programming, polyhedral combinatorics, knapsack problems",
author = "Letchford, {Adam Nicholas} and Georgia Souli",
note = "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, 47, 2, 2019 DOI: 10.1016/j.orl.2018.12.005",
year = "2019",
month = "1",
day = "17",
doi = "10.1016/j.orl.2018.12.005",
language = "English",
volume = "47",
pages = "83--88",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "2",

}

RIS

TY - JOUR

T1 - On lifted cover inequalities

T2 - a new lifting procedure with unusual properties

AU - Letchford, Adam Nicholas

AU - Souli, Georgia

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, 47, 2, 2019 DOI: 10.1016/j.orl.2018.12.005

PY - 2019/1/17

Y1 - 2019/1/17

N2 - Lifted cover inequalities are well-known cutting planes for 0-1 linear programs. We show how one of the earliest lifting procedures, due to Balas, can be significantly improved. The resulting procedure has some unusual properties. For example, (i) it can yield facet-defining inequalities even if the given cover is not minimal, (ii) it can yield facet-defining inequalities that cannot be obtained by standard lifting procedures, and (iii) the associated superadditive lifting function isinteger-valued almost everywhere.

AB - Lifted cover inequalities are well-known cutting planes for 0-1 linear programs. We show how one of the earliest lifting procedures, due to Balas, can be significantly improved. The resulting procedure has some unusual properties. For example, (i) it can yield facet-defining inequalities even if the given cover is not minimal, (ii) it can yield facet-defining inequalities that cannot be obtained by standard lifting procedures, and (iii) the associated superadditive lifting function isinteger-valued almost everywhere.

KW - integer programming

KW - polyhedral combinatorics

KW - knapsack problems

U2 - 10.1016/j.orl.2018.12.005

DO - 10.1016/j.orl.2018.12.005

M3 - Journal article

VL - 47

SP - 83

EP - 88

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 2

ER -