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

I. Dumitrescu, T. Stuetzle, G. R. Raidl, J. Meyer, M. Middendorf et al., Combinations of Local Search and Exact Algorithms, Applications of Evolutionary Computation, pp.211-223, 2003.
DOI : 10.1007/3-540-36605-9_20

A. Fréville, The multidimensional 0???1 knapsack problem: An overview, European Journal of Operational Research, vol.155, issue.1, pp.1-21, 2004.
DOI : 10.1016/S0377-2217(03)00274-1

B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Mathematical Programming, vol.15, issue.1, 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-1075, 1966.
DOI : 10.1287/opre.14.6.1045

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

P. Hansen and N. Mladenovi´cmladenovi´c, An Introduction to Variable Neighborhood Search Advances and Trends in Local Search Paradigms for Optimization, Metaheuristics, pp.433-458, 1999.

P. Hansen and N. Mladenovi´cmladenovi´c, A Tutorial on Variable Neighborhood Search, 2003.

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, 2004.
DOI : 10.1007/978-3-540-24777-7

J. Lorie and L. Savage, Three Problems in Rationing Capital, The Journal of Business, vol.28, issue.4, pp.229-239, 1955.
DOI : 10.1086/294081

A. Manne and H. Markowitz, On the solution of discrete programming problems, Econometrica, vol.25, pp.84-110, 1957.

J. Puchinger, Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems, 2006.

J. Puchinger and G. R. , Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification, Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, pp.41-53, 2005.
DOI : 10.1007/11499305_5
URL : https://hal.archives-ouvertes.fr/hal-01299565

J. Puchinger and G. R. , Relaxation Guided Variable Neighborhood Search, Proceedings of the XVIII Mini EURO Conference on VNS, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01224918

J. Puchinger, G. R. Raidl, and M. Gruber, Cooperating Memetic and Branch-and- Cut Algorithms for Solving the Multidimensional Knapsack Problem, Proceedings of MIC2005, the 6th Metaheuristics International Conference, pp.775-780, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01317132

J. Puchinger, G. R. Raidl, and U. Pferschy, The Core Concept for the Multidimensional Knapsack Problem, Evolutionary Computation in Combinatorial Optimization -EvoCOP, pp.195-208, 2006.
DOI : 10.1007/11730095_17
URL : https://hal.archives-ouvertes.fr/hal-01299570

G. R. 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 Int. Joint Conference on Artificial Intelligence, 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