Improving the 01 Multi Dimensional Knapsack Bounds

Michel Vasquez (1) , Said Hanafi (2) , Yannick Vimont (1)

1 LGI2P - Laboratoire de Génie Informatique et Ingénierie de Production
2 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

In this work, we propose an hybrid approach which combines tabu search, relaxation, pseudo--cuts and decomposition for the 01 Multi Dimensional Knapsack problem. Our first investigations give promising results for both the lower--bounds and the upper--bounds for large instances with 30 constraints and 500 variables.

Domaines: Recherche opérationnelle [math.OC]

Michel Vasquez, Said Hanafi, Yannick Vimont. Improving the 01 Multi Dimensional Knapsack Bounds. 9th Metaheuristics International Conference, Jul 2011, Italy. ⟨hal-00819834⟩