Improving the 01 Multi Dimensional Knapsack Bounds
Résumé
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.