Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Kaparis, Konstantinos and Letchford, Adam N. (2007) Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. European Journal of Operational Research, 91-103. (doi:10.1016/j.ejor.2007.01.032).
Full text not available from this repository.
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well-
known (and strongly N P -hard) combinatorial optimization problem
with many applications. Up to now, the ma jority of upper bounding
techniques for the 0-1 MKP have been based on Lagrangian or surro-
gate 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.
|Additional Information:||Article in press, corrected proof|
|Keywords:||integer programming, combinatorial optimization|
|Subjects:||Q Science > Q Science (General)
H Social Sciences > HA Statistics
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||12 Oct 2007|
|Last Modified:||27 Mar 2014 18:32|
|Contact Email Address:||firstname.lastname@example.org|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)