| Article ID: | iaor20052795 |
| Country: | France |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 415 |
| End Page Number: | 438 |
| Publication Date: | Oct 2001 |
| Journal: | RAIRO Operations Research |
| Authors: | Hao Jin-Kao, Vasquez Michel |
| Keywords: | heuristics |
We present in this article, a hybrid approach for solving the 0–1 multidimensional knapsack problem. This approach combines linear programming and Tabu search. The resulting algorithm improves on the best result on many well-known hard benchmarks.