Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem

被引：30
|
作者：
Kaparis, Konstantinos [1 ]
Letchford, Adam N. [1 ]
机构：
[1] Univ Lancaster, Dept Management Sci, Lancaster LA1 4YW, England
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2008年 / 186卷 / 01期
基金：
英国工程与自然科学研究理事会;
关键词：
integer programming; combinatorial optimization;
D O I：
10.1016/j.ejor.2007.01.032
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The 0-1 multidimensional knapsack problem (0-1 MKP) is a well-known (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upper bounding techniques for the 0-1 MKP have been based on Lagrangian or surrogate relaxation. We show that good upper bounds can be obtained by a cutting plane method based on lifted cover inequalities (LCIs). As well as using traditional LCIs, we use some new 'global' LCIs, which take the whole constraint matrix into account. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：91 / 103
页数：13
相关论文
共 50 条
  • [1] Heuristics for the 0-1 multidimensional knapsack problem
    Boyer, V.
    Elkihel, M.
    El Baz, D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) : 658 - 664
  • [2] The multidimensional 0-1 knapsack problem:: An overview
    Fréville, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (01) : 1 - 21
  • [3] Improving problem reduction for 0-1 Multidimensional Knapsack Problems with valid inequalities
    Gu, Hanyu
    COMPUTERS & OPERATIONS RESEARCH, 2016, 71 : 82 - 89
  • [4] LIFTED COVER FACETS OF THE 0-1 KNAPSACK POLYTOPE WITH GUB CONSTRAINTS
    NEMHAUSER, GL
    VANCE, PH
    OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 255 - 263
  • [5] Lifted cover inequalities for 0-1 integer programs: Complexity
    Gu, ZH
    Nemhauser, GL
    Savelsbergh, MWP
    INFORMS JOURNAL ON COMPUTING, 1999, 11 (01) : 117 - 123
  • [6] Local Cuts for 0-1 Multidimensional Knapsack Problems
    Gu, Hanyu
    DATA AND DECISION SCIENCES IN ACTION, 2018, : 81 - 89
  • [7] A flipping local search genetic algorithm for the multidimensional 0-1 knapsack problem
    Alonso, Cesar L.
    Caro, Fernando
    Montana, Jose Luis
    CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, 2006, 4177 : 21 - 30
  • [8] Problem reduction heuristic for the 0-1 multidimensional knapsack problem
    Hill, Raymond R.
    Cho, Yong Kun
    Moore, James T.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 19 - 26
  • [9] Improved results on the 0-1 multidimensional knapsack problem
    Vasquez, M
    Vimont, Y
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) : 70 - 81
  • [10] Lifted flow cover inequalities for mixed 0-1 integer programs
    Gu, ZH
    Nemhauser, GL
    Savelsbergh, MWP
    MATHEMATICAL PROGRAMMING, 1999, 85 (03) : 439 - 467
12345