Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound
Year of publication: |
2010
|
---|---|
Authors: | Boyer, Vincent ; El Baz, Didier ; Elkihel, Moussa |
Published in: |
European journal of industrial engineering : EJIE. - Genevè : Inderscience Enterprises Ltd., ISSN 1751-5254, ZDB-ID 2384377-9. - Vol. 4.2010, 4, p. 434-449
|
Subject: | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung | Dynamic programming | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Branch-and-bound and dynamic programming approaches for the knapsack problem
Burashnikov, Evgenii, (2024)
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
- More ...
-
Boyer, Vincent, (2010)
-
Improved time and space complexity for Kianfar's inequality rotation algorithm
El Baz, Didier, (2008)
-
Improved time and space complexity for Kianfar's inequality rotation algorithm
El Baz, Didier, (2008)
- More ...