• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Thumbnail
Date
2017
Dewey
Recherche opérationnelle
Sujet
Combinatorial optimization; Maximal knapsack packing; Minimal knapsack cover; Dynamic programming; Integer programming
Journal issue
European Journal of Operational Research
Volume
262
Number
2
Publication date
10-2017
Article pages
438-448
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.ejor.2017.03.061
URI
https://basepub.dauphine.fr/handle/123456789/18639
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Furini, Fabio
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ljubić, Ivana
24359 ESSEC Business School
Sinnl, Markus
59285 Department of Statistics and Operations Research
Type
Article accepté pour publication ou publié
Abstract (EN)
Given a set of items with profits and weights and a knapsack capacity, we study the problem of finding a maximal knapsack packing that minimizes the profit of the selected items. We propose an effective dynamic programming (DP) algorithm which has a pseudo-polynomial time complexity. We demonstrate the equivalence between this problem and the problem of finding a minimal knapsack cover that maximizes the profit of the selected items. In an extensive computational study on a large and diverse set of benchmark instances, we demonstrate that the new DP algorithm outperforms a state-of-the-art commercial mixed-integer programming (MIP) solver applied to the two best performing MIP models from the literature.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.