A dynamic programming based reduction procedure for the multidimensional 0 - 1 knapsack problem
| Year of publication: |
2008
|
|---|---|
| Authors: | Balev, Stefan ; Yanev, Nicola ; Fréville, Arnaud ; Andonov, Rumen |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 186.2008, 1, p. 63-76
|
| Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Ganzzahlige Optimierung | Integer programming |
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Djeumou Fomeni, Franklin, (2021)
-
Network models for multiobjective discrete optimization
Bergman, David, (2022)
-
Numerically safe lower bounds for the capacitated vehicle routing problem
Fukasawa, Ricardo, (2017)
- More ...
-
A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem
Balev, Stefan, (2008)
-
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
Balev, Stefan, (2008)
-
Protein Threading: From Mathematical Models to Parallel Implementations
Andonov, Rumen, (2004)
- More ...