.png){kind=icon}
返回
Cover and pack inequalities for (Mixed) integer programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3442-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
integer programming
knapsack polyhedra
lifting
superadditive functions
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Regulation of the Mouse Ventral Tegmental Area by Melanin-Concentrating Hormone黑色素浓缩激素对小鼠腹侧被盖区的调控
OAAI
OAAI分享收藏Isolation of an isoflavonoid and a terpenoid from the heartwood of Baphia nitida Lodd. (camwood)从Baphia nitida Lodd.（红木）的心材中分离得到一种异黄酮类化合物和一种类萜化合物。OAAI
OAAI分享收藏
查看更多内容