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 条
  • [31] A HEURISTIC 0-1 INTEGER PROGRAMMING METHOD
    BAESSLER, F
    OR SPEKTRUM, 1992, 14 (01) : 11 - 18
  • [32] Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities
    Gu, Xiaoyi
    Dey, Santanu S.
    Richard, Jean-Philippe P.
    INFORMS JOURNAL ON COMPUTING, 2024, 36 (03) : 884 - 899
  • [33] On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs
    Todosijevic, Raca
    Hanafi, Said
    Glover, Fred
    DISCRETE APPLIED MATHEMATICS, 2022, 308 : 235 - 254
  • [34] Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
    Ntaimo, Lewis
    Tanner, Matthew W.
    JOURNAL OF GLOBAL OPTIMIZATION, 2008, 41 (03) : 365 - 384
  • [35] Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
    Lewis Ntaimo
    Matthew W. Tanner
    Journal of Global Optimization, 2008, 41 : 365 - 384
  • [36] Optical computed tomography with 0-1 integer constaraints
    Amaya, Kenji
    Kikuchi, Ryu
    Suga, Kazuhiro
    Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A, 2006, 72 (10): : 1437 - 1442
  • [37] On characterizing tighter formulations for 0-1 programs
    Escudero, LF
    Munoz, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (01) : 172 - 176
  • [38] Dynamic Lagrangian dual and reduced RLT constructs for solving 0-1 mixed-integer programs
    Sherali, Hanif D.
    Smith, J. Cole
    TOP, 2012, 20 (01) : 173 - 189
  • [39] Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
    Mehmanchi, Erfan
    Gomez, Andres
    Prokopyev, Oleg A.
    JOURNAL OF GLOBAL OPTIMIZATION, 2019, 75 (02) : 273 - 339
  • [40] A class of hard small 0-1 programs
    Cornuéjols, G
    Dawande, M
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 284 - 293
12345