A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2008

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

(1) , (2, 3, 4) , (5) , (2)
1
2
3
4
5

Domains

Computer Science [cs] Operations Research [cs.RO] Computer Science [cs] Discrete Mathematics [cs.DM]

Rumen Andonov  : Connect in order to contact the contributor

https://hal.inria.fr/inria-00184771

Submitted on : Thursday, November 1, 2007-5:22:25 PM

Last modification on : Monday, February 6, 2023-10:04:07 AM

Not file

Dates and versions

inria-00184771 , version 1 (01-11-2007)

Identifiers

Cite

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, 2008, 186 (1), pp.63-76. ⟨10.1016/j.ejor.2006.02.058⟩. ⟨inria-00184771⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

EC-PARIS UNIV-RENNES1 CNRS INRIA UNIV-VALENCIENNES INSA-RENNES IRISA IRISA-D7 COMUE-NORMANDIE INRIA2 TDS-MACS UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UNILEHAVRE INSA-GROUPE UR1-MATH-NUM LAMIH INSA-HAUTS-DE-FRANCE
163 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More