The University of Southampton
University of Southampton Institutional Repository

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

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
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.
integer programming, combinatorial optimization
0377-2217
91-103
Kaparis, Konstantinos
29a564bc-2835-43ee-bf21-50e65e0a894a
Letchford, Adam N.
43c21ba9-1849-4c67-ba88-d03c300c50e4
Kaparis, Konstantinos
29a564bc-2835-43ee-bf21-50e65e0a894a
Letchford, Adam N.
43c21ba9-1849-4c67-ba88-d03c300c50e4

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).

Record type: Article

Abstract

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.

This record has no associated files available for download.

More information

Submitted date: 5 January 2007
Published date: 20 February 2007
Additional Information: Article in press, corrected proof
Keywords: integer programming, combinatorial optimization
Organisations: Operational Research

Identifiers

Local EPrints ID: 48753
URI: http://eprints.soton.ac.uk/id/eprint/48753
ISSN: 0377-2217
PURE UUID: faebf795-1458-40d6-8d5b-4b9c8db01ae6

Catalogue record

Date deposited: 12 Oct 2007
Last modified: 15 Mar 2024 09:49

Export record

Altmetrics

Contributors

Author: Konstantinos Kaparis
Author: Adam N. Letchford

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×