Home > Research > Publications & Outputs > Lifting the knapsack cover inequalities for the...

Electronic data

  • knapsack-cover

    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, 48, 5, 2020 DOI: 10.1016/j.orl.2020.07.010

    Accepted author manuscript, 327 KB, PDF document

    Embargo ends: 22/01/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

Lifting the knapsack cover inequalities for the knapsack polytope

Research output: Contribution to journalJournal article

Published

Standard

Lifting the knapsack cover inequalities for the knapsack polytope. / Letchford, Adam; Souli, Georgia.

In: Operations Research Letters, Vol. 48, No. 5, 01.09.2020, p. 607-611.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Letchford, Adam ; Souli, Georgia. / Lifting the knapsack cover inequalities for the knapsack polytope. In: Operations Research Letters. 2020 ; Vol. 48, No. 5. pp. 607-611.

Bibtex

@article{724cdb4adda34bebaba04efafc2a30a7,
title = "Lifting the knapsack cover inequalities for the knapsack polytope",
abstract = "Valid inequalities for the knapsack polytope have proven to be very useful in exact algorithms for mixed-integer linear programming. In this paper, we focus on the knapsack cover inequalities, introduced in 2000 by Carr and co-authors. In general, these inequalities can be rather weak. To strengthen them, we use lifting. Since exact lifting can be time-consuming, we present two fast approximate lifting procedures. The first procedure is based on mixed-integer rounding, whereas thesecond uses superadditivity.",
keywords = "mixed-integer linear programming, knapsack problems, polyhedral combinatorics",
author = "Adam Letchford and Georgia Souli",
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, 48 (5), 607-611, 2020 DOI: 10.1016/j.orl.2020.07.010",
year = "2020",
month = sep,
day = "1",
doi = "10.1016/j.orl.2020.07.010",
language = "English",
volume = "48",
pages = "607--611",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "5",

}

RIS

TY - JOUR

T1 - Lifting the knapsack cover inequalities for the knapsack polytope

AU - Letchford, Adam

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, 48 (5), 607-611, 2020 DOI: 10.1016/j.orl.2020.07.010

PY - 2020/9/1

Y1 - 2020/9/1

N2 - Valid inequalities for the knapsack polytope have proven to be very useful in exact algorithms for mixed-integer linear programming. In this paper, we focus on the knapsack cover inequalities, introduced in 2000 by Carr and co-authors. In general, these inequalities can be rather weak. To strengthen them, we use lifting. Since exact lifting can be time-consuming, we present two fast approximate lifting procedures. The first procedure is based on mixed-integer rounding, whereas thesecond uses superadditivity.

AB - Valid inequalities for the knapsack polytope have proven to be very useful in exact algorithms for mixed-integer linear programming. In this paper, we focus on the knapsack cover inequalities, introduced in 2000 by Carr and co-authors. In general, these inequalities can be rather weak. To strengthen them, we use lifting. Since exact lifting can be time-consuming, we present two fast approximate lifting procedures. The first procedure is based on mixed-integer rounding, whereas thesecond uses superadditivity.

KW - mixed-integer linear programming

KW - knapsack problems

KW - polyhedral combinatorics

U2 - 10.1016/j.orl.2020.07.010

DO - 10.1016/j.orl.2020.07.010

M3 - Journal article

VL - 48

SP - 607

EP - 611

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -