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

Stefan Balev; Nicola Yanev; Arnaud Fréville; Rumen Andonov

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

Stefan Balev ¹ Nicola Yanev ^{2, 3, 4} Arnaud Fréville ⁵ Rumen Andonov ²

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

Domain :

Computer Science [cs] / Operations Research [cs.RO]

Computer Science [cs] / Discrete Mathematics [cs.DM]

Complete list of metadatas

https://hal.inria.fr/inria-00184771
Contributor : Rumen Andonov <>
Submitted on : Thursday, November 1, 2007 - 5:22:25 PM
Last modification on : Thursday, April 4, 2019 - 11:48:11 AM

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

Identifiers

Collections

Citation

Export

Metrics

342

Contact

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

Identifiers

Collections

Citation

Export

Share

Metrics

342

Contact