A hybrid approach for the 0–1 multidimensional knapsack problem
Résumé
We present a hybrid approach for the 0--1 multidimensional knapsack problem. The proposed approach combines linear programming and Tabu Search. The resulting algorithm improves significantly on the best known results of a set of more than 150 benchmark instances
Fichier principal
a-hybrid-approach-for-the-0-1-multidimensional.pdf (129.43 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|