.png){kind=icon}
Return
Cover and pack inequalities for (Mixed) integer programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3442-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 the 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.
Keywords:
integer programming
knapsack polyhedra
lifting
superadditive functions
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveIsolation of an isoflavonoid and a terpenoid from the heartwood of Baphia nitida Lodd. (camwood)
OAAI
OAAIShareSave
View more