Skip to Main content Skip to Navigation
Journal articles

The Multidimensional Knapsack Problem: Structure and Algorithms

Abstract : We study the multidimensional knapsack problem, present some theoretical and empirical results about its structure, and evaluate different Integer Linear Programming (ILP) based, metaheuristic, and collaborative approaches for it. We start by considering the distances between optimal solutions to the LP-relaxation and the original problem and then introduce a new core concept for the MKP, which we study extensively. The empirical analysis is then used to develop new concepts for solving the MKP using ILP-based and memetic algorithms. Different collaborative combinations of the presented methods are discussed and evaluated. Further computational experiments with longer run-times are also performed in order to compare the solutions of our approaches to the best known solutions of another so far leading approach for common MKP benchmark instances. The extensive computational experiments show the effectiveness of the proposed methods, which yield highly competitive results in significantly shorter run-times than previously described approaches.
Document type :
Journal articles
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01224914
Contributor : Jakob Puchinger <>
Submitted on : Thursday, November 5, 2015 - 11:59:26 AM
Last modification on : Tuesday, June 15, 2021 - 4:17:43 PM
Long-term archiving on: : Saturday, February 6, 2016 - 11:18:49 AM

File

puchinger-07.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jakob Puchinger, Günther Raidl, Ulrich Pferschy. The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2010, 22 (2), pp.250 - 265. ⟨10.1287/ijoc.1090.0344⟩. ⟨hal-01224914⟩

Share

Metrics

Record views

269

Files downloads

4734