Improved Results on the 0-1 Multi-Knapsack Problem
Résumé
In previous works (Vasquez&Hao IJCAI01) we presented an algorithm that combines linear programming and tabu search that gives best results on the OR-Library benchmarks (Chu&Bealsey JoH98). Embedding this algorithm in a partial enumertive techniqueand a variables fixing heuristic improves again our previous results. Furthermore sub problems with less than 100 variables generated from the 500 original ones. Cplex70 fails to solve them in 3 days with a 2GB-600MHz cpu.