Cover and pack inequalities for (mixed) integer programming

Cover and pack inequalities for (mixed) integer programming

0.00 Avg rating0 Votes
Article ID: iaor2006988
Country: Netherlands
Volume: 139
Issue: 1
Start Page Number: 21
End Page Number: 38
Publication Date: Oct 2005
Journal: Annals of Operations Research
Authors:
Keywords: knapsack problem
Abstract:

We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0–1 knapsack set, the mixed 0–1 knapsack set, the integer knapsack set, and the mixed integer knapsack set. Our aim is to give a unified presentation of the inequalities based on covers and packs and highlight the connections among them. The focus of this paper is on recent research on the use of superadditive functions for the analysis of knapsack polyhedra. We also present some new results on integer knapsacks. In particular, we give an integer version of the cover inequalities and describe a necessary and sufficient facet condition for them. This condition generalizes the well-known facet condition of minimality of covers for 0–1 knapsacks.

Reviews

Required fields are marked *. Your email address will not be published.