A Hybrid Approach for the 01 Multidimensional Knapsack problem
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 328-332.
Abstract
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.
Michel Vasquez, and Jin-Kao Hao. 2001. A Hybrid Approach for the 01 Multidimensional Knapsack problem. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 328–332. https://ijcai.org/proceedings/2001/47
Vasquez, M., & Hao, J. (2001). A Hybrid Approach for the 01 Multidimensional Knapsack problem. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 (pp. 328–332). IJCAI. https://ijcai.org/proceedings/2001/47
@inproceedings{ijcai2001p47,
title = {A Hybrid Approach for the 01 Multidimensional Knapsack problem},
author = {Vasquez, Michel and Hao, Jin-Kao},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {328--332},
year = {2001},
url = {https://ijcai.org/proceedings/2001/47},
}
TY - CPAPER TI - A Hybrid Approach for the 01 Multidimensional Knapsack problem AU - Vasquez, Michel AU - Hao, Jin-Kao T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 328 EP - 332 UR - https://ijcai.org/proceedings/2001/47 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
