E. Balas and E. Zemel, An Algorithm for Large Zero-One Knapsack Problems, Operations Research, vol.28, issue.5, pp.1130-1154, 1980.
DOI : 10.1287/opre.28.5.1130

P. Chu and J. Beasley, A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics, vol.4, issue.1, pp.63-86, 1998.
DOI : 10.1023/A:1009642405419

E. Danna, E. Rothberg, and C. Le-pape, Exploring relaxation induced neighborhoods to improve MIP solutions, Mathematical Programming , Series A 102, pp.71-90, 2005.
DOI : 10.1007/s10107-004-0518-7

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, vol.98, issue.1-3, pp.23-47, 2003.
DOI : 10.1007/s10107-003-0395-5

B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Mathematical Programming 31, pp.78-105, 1985.
DOI : 10.1007/BF02591863

P. Gilmore and R. Gomory, The Theory and Computation of Knapsack Functions, Operations Research, vol.14, issue.6, pp.1045-1074, 1966.
DOI : 10.1287/opre.14.6.1045

F. Glover and G. Kochenberger, Critical Event Tabu Search for Multidimensional Knapsack Problems, pp.407-427, 1996.
DOI : 10.1007/978-1-4613-1361-8_25

C. Gomes-da-silva, J. Clímaco, and J. Figueira, Core problems in bi-criteria 0,1- knapsack: new developments, 2005.

S. Martello and P. Toth, A New Algorithm for the 0-1 Knapsack Problem, Management Science, vol.34, issue.5, pp.633-644, 1988.
DOI : 10.1287/mnsc.34.5.633

D. Pisinger, An expanding-core algorithm for the exact 0???1 knapsack problem, European Journal of Operational Research, vol.87, issue.1, pp.175-187, 1995.
DOI : 10.1016/0377-2217(94)00013-3

D. Pisinger, A Minimal Algorithm for the 0-1 Knapsack Problem, Operations Research, vol.45, issue.5, pp.758-767, 1997.
DOI : 10.1287/opre.45.5.758

J. Puchinger, G. Raidl, and U. Pferschy, The core concept for the multidimensional knapsack problem, in 'Evolutionary Computation in Combinatorial Optimization -EvoCOP, LNCS, vol.3906, pp.195-208, 2006.

J. Puchinger, G. Raidl, and U. Pferschy, The Multidimensional Knapsack Problem: Structure and Algorithms, INFORMS Journal on Computing, vol.22, issue.2, 2007.
DOI : 10.1287/ijoc.1090.0344
URL : https://hal.archives-ouvertes.fr/hal-01224914

G. Raidl and J. Gottlieb, Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem, Evolutionary Computation, vol.32, issue.4, pp.441-475, 2005.
DOI : 10.1162/106365602317301781

W. Shih, A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem, Journal of the Operational Research Society, vol.30, issue.4, pp.369-378, 1979.
DOI : 10.1057/jors.1979.78

M. Vasquez and J. Hao, A hybrid approach for the 0?1 multidimensional knapsack problem, Proceedings of the 17th International Joint Conference on Artificial Intelligence pp, pp.328-333, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00359413

M. Vasquez and Y. Vimont, Improved results on the 0???1 multidimensional knapsack problem, European Journal of Operational Research, vol.165, issue.1, pp.70-81, 2005.
DOI : 10.1016/j.ejor.2004.01.024
URL : https://hal.archives-ouvertes.fr/hal-00353909

H. M. Weingartner and D. N. Ness, Methods for the Solution of the Multidimensional 0/1 Knapsack Problem, Operations Research, vol.15, issue.1, pp.83-103, 1967.
DOI : 10.1287/opre.15.1.83