A Hybrid Approach for the 01 Multidimensional Knapsack problem.
作者： Jin-Kao Hao , Michel Vasquez
DOI:
关键词:
摘要:
参考文章(12)
María A. Osorio, Fred Glover, Peter Hammer, Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions Annals of Operations Research. ,vol. 117, pp. 71- 93 ,(2002) , 10.1023/A:1021513321301
A. Drexl, A simulated annealing approach to the multiconstraint zero-one knapsack problem Computing. ,vol. 40, pp. 1- 8 ,(1988) , 10.1007/BF02242185
Fred Glover, Gary A. Kochenberger, Critical Event Tabu Search for Multidimensional Knapsack Problems Springer, Boston, MA. pp. 407- 427 ,(1996) , 10.1007/978-1-4613-1361-8_25
P.C. Chu, J.E. Beasley, A Genetic Algorithm for the Multidimensional Knapsack Problem Journal of Heuristics. ,vol. 4, pp. 63- 86 ,(1998) , 10.1023/A:1009642405419
A. Freville, G. Plateau, Heuristics and reduction methods for multiple constraints 0–1 linear programming problems European Journal of Operational Research. ,vol. 24, pp. 206- 215 ,(1986) , 10.1016/0377-2217(86)90042-1
Yoshiaki Toyoda, A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems Management Science. ,vol. 21, pp. 1417- 1427 ,(1975) , 10.1287/MNSC.21.12.1417
Saïd Hanafi, Arnaud Freville, An efficient tabu search approach for the 0–1 multidimensional knapsack problem European Journal of Operational Research. ,vol. 106, pp. 659- 675 ,(1998) , 10.1016/S0377-2217(97)00296-8
Wei Shih, A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem Journal of the Operational Research Society. ,vol. 30, pp. 369- 378 ,(1979) , 10.1057/JORS.1979.78
Ronny Aboudi, Kurt Jörnsten, Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic Informs Journal on Computing. ,vol. 6, pp. 82- 93 ,(1994) , 10.1287/IJOC.6.1.82
Bezalel Gavish, Hasan Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality Mathematical Programming. ,vol. 31, pp. 78- 105 ,(1985) , 10.1007/BF02591863