Skip to Main content Skip to Navigation
Journal articles

A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem

Stefan Balev 1 Nicola Yanev 2, 3, 4 Arnaud Fréville 5 Rumen Andonov 2
1 LIH - Laboratoire d'informatique du Havre
2 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
3 University of Sofia
4 Department Probability, Operations Research and Statistics
5 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201
Keywords : Dynamic programming Integer programming Multidimensional knapsack problem Variable reduction Heuristics
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00184771
Contributor : Rumen Andonov Connect in order to contact the contributor
Submitted on : Thursday, November 1, 2007 - 5:22:25 PM
Last modification on : Tuesday, October 19, 2021 - 6:38:11 PM

Identifiers

Collections

INRIA | IRISA | CNRS | UNIV-RENNES1 | IRISA-D7 | UR1-MATH-STIC | TDS-MACS | COMUE-NORMANDIE | UR1-UFR-ISTIC | UNIV-RENNES | UNILEHAVRE | UNIV-VALENCIENNES | INSA-GROUPE | INSA-RENNES | LAMIH | EC-PARIS

Citation

Stefan Balev, Nicola Yanev, Arnaud Fréville, Rumen Andonov. A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. European Journal of Operational Research, Elsevier, 2008, 186 (1), pp.63-76. ⟨10.1016/j.ejor.2006.02.058⟩. ⟨inria-00184771⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

411

 

Contact                    Legal Notice                    Personal Data