On the complexity of sequentially lifting cover inequalities for the knapsack polytope

被引：0
|
作者：
Wei-Kun Chen [1 ,2 ,3 ]
Yu-Hong Dai [2 ,3 ]
机构：
[1] School of Mathematics and Statistics, Beijing Institute of Technology
[2] LSEC, ICMSEC, Academy of Mathematics and Systems Science,Chinese Academy of Sciences
[3] School of Mathematical Sciences, University of Chinese Academy of Sciences
来源：
Science China Mathematics | 2021年 / 64卷 / 01期
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
O221.4 [整数规划];
学科分类号：
070105 ; 1201 ;
摘要：
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover inequality can be computed in polynomial time for a given minimal cover(Gu et al.(1999)). We show that this problem is N P-hard, thus giving a negative answer to the question.
引用
收藏
页码：211 / 220
页数：10
相关论文
共 50 条
  • [1] On the complexity of sequentially lifting cover inequalities for the knapsack polytope
    Chen, Wei-Kun
    Dai, Yu-Hong
    [J]. SCIENCE CHINA-MATHEMATICS, 2021, 64 (01) : 211 - 220
  • [2] On the complexity of sequentially lifting cover inequalities for the knapsack polytope
    Wei-Kun Chen
    Yu-Hong Dai
    [J]. Science China Mathematics, 2021, 64 : 211 - 220
  • [3] Lifting the knapsack cover inequalities for the knapsack polytope
    Letchford, Adam N.
    Souli, Georgia
    [J]. OPERATIONS RESEARCH LETTERS, 2020, 48 (05) : 607 - 611
  • [4] Lifting cover inequalities for the precedence-constrained knapsack problem
    Park, K
    Park, S
    [J]. DISCRETE APPLIED MATHEMATICS, 1997, 72 (03) : 219 - 241
  • [5] Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
    Easton, Todd
    Hooker, Kevin
    [J]. DISCRETE OPTIMIZATION, 2008, 5 (02) : 254 - 261
  • [6] A note on the extension complexity of the knapsack polytope
    Pokutta, Sebastian
    Van Vyve, Mathieu
    [J]. OPERATIONS RESEARCH LETTERS, 2013, 41 (04) : 347 - 350
  • [7] On the Complexity of Separation from the Knapsack Polytope
    Del Pia, Alberto
    Linderoth, Jeff
    Zhu, Haoran
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2022, 2022, 13265 : 168 - 180
  • [8] On the complexity of separating cutting planes for the knapsack polytope
    Del Pia, Alberto
    Linderoth, Jeff
    Zhu, Haoran
    [J]. MATHEMATICAL PROGRAMMING, 2024, 206 (1-2) : 33 - 59
  • [9] Lifting for the integer knapsack cover polyhedron
    Chen, Wei-Kun
    Chen, Liang
    Dai, Yu-Hong
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2023, 86 (01) : 205 - 249
  • [10] Lifting for the integer knapsack cover polyhedron
    Wei-Kun Chen
    Liang Chen
    Yu-Hong Dai
    [J]. Journal of Global Optimization, 2023, 86 : 205 - 249
12345