Lifted cover inequalities for 0-1 integer programs: Complexity

被引：46

作者：

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 条

[21] A p-cone sequential relaxation procedure for 0-1 integer programs
Burer, Samuel
Chen, Jieqiu
OPTIMIZATION METHODS & SOFTWARE, 2009, 24 (4-5): : 523 - 548
[22] A cutting-plane approach to mixed 0-1 stochastic integer programs
Caroe, CC
Tind, J
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (02) : 306 - 316
[23] A computational study of parametric tabu search for 0-1 mixed integer programs
Sacchi, Luis Henrique
Armentano, Vinicius Amaral
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (02) : 464 - 473
[24] A SIMPLEX PROCEDURE FOR LINEAR-PROGRAMS WITH SOME 0-1 INTEGER CONSTRAINTS
CHAKRAVARTY, AK
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 9 (04) : 353 - 358
[25] A RECURSIVE PROCEDURE TO GENERATE ALL CUTS FOR 0-1 MIXED INTEGER PROGRAMS
NEMHAUSER, GL
WOLSEY, LA
MATHEMATICAL PROGRAMMING, 1990, 46 (03) : 379 - 390
[26] Mixed Integer Lifted Cover Inequalities for knapsack problems with a single continuous variable
Avella, Pasquale
Boccia, Maurizio
Mattia, Sara
2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
[27] Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs
Hoen, Alexander
Oerte, Andy
Gleixner, Ambros
Nordstrom, Jakob
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, PT I, CPAIOR 2024, 2024, 14742 : 310 - 328
[28] New class of 0-1 integer programs with tight approximation via linear relaxations
Asratian, AS
Kuzjurin, NN
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2001, 53 (03) : 363 - 370
[29] New class of 0-1 integer programs with tight approximation via linear relaxations
A. S. Asratian
N. N. Kuzjurin
Mathematical Methods of Operations Research, 2001, 53 : 363 - 370
[30] CHARACTERIZATION OF DIAGRAMS BY 0-1 INEQUALITIES
ROSENBERG, IG
DISCRETE MATHEMATICS, 1987, 63 (2-3) : 261 - 270

← 1 2 3 4 5 →