The University of Southampton
University of Southampton Institutional Repository

On separating cover inequalities for the multidimensional knapsack problem

On separating cover inequalities for the multidimensional knapsack problem
On separating cover inequalities for the multidimensional knapsack problem
We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programming model. Solving this kind of integer programs is usually considered expensive and the proposed method may have been overlooked because of this assumption. The results of our experiments with a small set of randomly generated problems and problems taken from the literature indicate that the method may be a reasonable alternative to the one currently in use
integer programming, cover inequalities, separation problem
0305-0548
1771-1776
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oğuz, O.
c88da51b-af05-4b47-b1da-57162659856d
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oğuz, O.
c88da51b-af05-4b47-b1da-57162659856d

Bektas, T. and Oğuz, O. (2007) On separating cover inequalities for the multidimensional knapsack problem. Computers and Operations Research, 34 (6), 1771-1776. (doi:10.1016/j.cor.2005.05.032).

Record type: Article

Abstract

We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programming model. Solving this kind of integer programs is usually considered expensive and the proposed method may have been overlooked because of this assumption. The results of our experiments with a small set of randomly generated problems and problems taken from the literature indicate that the method may be a reasonable alternative to the one currently in use

This record has no associated files available for download.

More information

Published date: June 2007
Keywords: integer programming, cover inequalities, separation problem
Organisations: Management

Identifiers

Local EPrints ID: 47685
URI: http://eprints.soton.ac.uk/id/eprint/47685
ISSN: 0305-0548
PURE UUID: 82ff0c37-f72e-4e74-b5c2-03f3f36e652f
ORCID for T. Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 08 Aug 2007
Last modified: 15 Mar 2024 09:35

Export record

Altmetrics

Contributors

Author: T. Bektas ORCID iD
Author: O. Oğuz

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.

×