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 条
  • [21] Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem
    Dantas, Bianca de Almeida
    Caceres, Edson Norberto
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 : 2739 - 2743
  • [22] Solution to the 0-1 Multidimensional Knapsack Problem Based on DNA Computation
    Wu, Kee-Rong
    Yeh, Chung-Wei
    INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS II, PTS 1-3, 2011, 58-60 : 1767 - +
  • [23] An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem
    Sundar, Shyam
    Singh, Alok
    Rossi, Andre
    CONTEMPORARY COMPUTING, PT 1, 2010, 94 : 141 - +
  • [24] Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem
    Moraga, RJ
    DePuy, GW
    Whitehouse, GE
    COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (01) : 83 - 96
  • [25] The multidimensional 0-1 knapsack problem-bounds and computational aspects
    Fréville, A
    Hanafi, S
    ANNALS OF OPERATIONS RESEARCH, 2005, 139 (01) : 195 - 227
  • [26] An efficient tabu search approach for the 0-1 multidimensional knapsack problem
    Hanafi, S
    Freville, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 659 - 675
  • [27] A Binary differential search algorithm for the 0-1 multidimensional knapsack problem
    Liu, Jianjun
    Wu, Changzhi
    Cao, Jiang
    Wang, Xiangyu
    Teo, Kok Lay
    APPLIED MATHEMATICAL MODELLING, 2016, 40 (23-24) : 9788 - 9805
  • [28] Reoptimizing the 0-1 knapsack problem
    Archetti, Claudia
    Bertazzi, Luca
    Speranza, M. Grazia
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (17) : 1879 - 1887
  • [29] COLLAPSING 0-1 KNAPSACK PROBLEM
    POSNER, ME
    GUIGNARD, M
    MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 155 - 161
  • [30] ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    LAURIERE, M
    MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 1 - 10
12345