Improved Results on the 0-1 Multi-Knapsack Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

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.
Fichier non déposé

Dates et versions

hal-00361217 , version 1 (13-02-2009)

Identifiants

  • HAL Id : hal-00361217 , version 1

Citer

Michel Vasquez. Improved Results on the 0-1 Multi-Knapsack Problem. The sixteenth triennal conference of the International Federation of Operational Research Societies, Jul 2002, Edinburgh, United Kingdom. pp.53. ⟨hal-00361217⟩
28 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More