A Multi-Level Search Strategy for the 0-1 Multidimensional Knapsack Problem.

Abstract : We propose an exact method based on a multi-level search strategy for solving the 0-1 Multidimensional Knapsack Problem. Our search strategy is primarily based on the reduced costs of the non-basic variables of the LP-relaxation solution. Considering that the variables are sorted in decreasing order of their absolute reduced cost value, the top level branches of the search tree are enumerated following Resolution Search strategy, the middle level branches are enumerated following Branch & Bound strategy and the lower level branches are enumerated according to a simple Depth First Search enumeration strategy. Experimentally, this cooperative scheme is able to solve optimally large-scale strongly correlated 0 1 Multidimensional Knapsack Problem instances. The optimal values of all the 10 constraint, 500 variable instances and some of the 30 constraint, 250 variable instances of the OR-Library were found. These values were previously unknown.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00814762
Contributor : Michel Vasquez <>
Submitted on : Wednesday, April 17, 2013 - 4:13:41 PM
Last modification on : Saturday, March 23, 2019 - 1:22:43 AM

Links full text

Identifiers

Collections

Citation

Michel Vasquez, Yannick Vimont, Philippe Michelon. A Multi-Level Search Strategy for the 0-1 Multidimensional Knapsack Problem.. Discrete Applied Mathematics, Elsevier, 2010, 158, pp.97-109. ⟨10.1016/j.dam.2009.08.007⟩. ⟨hal-00814762⟩

Share

Metrics

Record views

83