Lifted cover inequalities for 0-1 integer programs: Complexity

被引：48
|
作者：
Gu, ZH [1 ]
Nemhauser, GL [1 ]
Savelsbergh, MWP [1 ]
机构：
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
来源：
INFORMS JOURNAL ON COMPUTING | 1999年 / 11卷 / 01期
关键词：
D O I：
10.1287/ijoc.11.1.117
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted-cover inequalities (LCIs). We show that given a fractional point, determining a violated LCI over all minimal covers is NP-hard. The main result is that there exists a class of 0-1 knapsack instances for which any branch-and-out algorithm based on LCls has to evaluate an exponential number of nodes to prove optimality.
引用
收藏
页码：117 / 123
页数：7
相关论文
共 50 条
12345