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
<mark>Journal publication date</mark>1/09/2020
<mark>Journal</mark>Operations Research Letters
Issue number5
Volume48
Number of pages5
Pages (from-to)607-611
Publication statusPublished
Early online date22/07/20
Original languageEnglish

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 the
second uses superadditivity.

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