Combining Resolution Search and Dynamic Programming for the 0-1 Multidimensional Knapsack Problem.

Abstract : We propose an exact method which combines resolution search, branch and bound, and dynamic programming algorithm for solving the 0-1 Multidimensional Knapsack Problem. Our method is a multi-level search strategy where the top level branches of the search tree are enumerated using Resolution Search, the middle level branches are enumerated using Branch & Bound and the lower level branches are solved with dynamic programming. The proposed algorithm is competitive with the existing heuristics in terms of convergence and is able to prove large-scale strong correlated instances of the OR-Library
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00819826
Contributor : Michel Vasquez <>
Submitted on : Thursday, May 2, 2013 - 2:36:33 PM
Last modification on : Saturday, March 23, 2019 - 1:22:44 AM

Identifiers

  • HAL Id : hal-00819826, version 1

Citation

Michel Vasquez, Sylvain Boussier, Said Hanafi, Yannick Vimont, Christophe Wilbaut. Combining Resolution Search and Dynamic Programming for the 0-1 Multidimensional Knapsack Problem.. International Federation of Operational Research Societies, Jul 2011, Australia. ⟨hal-00819826⟩

Share

Metrics

Record views

110