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

@article{Kaparis2008LocalAG,
  title={Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem},
  author={Konstantinos Kaparis and Adam N. Letchford},
  journal={European Journal of Operational Research},
  year={2008},
  volume={186},
  pages={91-103}
}
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (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… CONTINUE READING