1. Angelelli E, Mansini R, Speranza MG. Kernel Search: a heuristic framework for MILP problems with binary variables. Technical Report of the Department of Electronics for Automation, University of Brescia, R.T. 2007-04-56, December 2007.
2. An algorithm for large zero–one knapsack problems;Balas;Operations Research,1980
3. Boussier S, Vasquez M, Vimont Y, Hanafi S, Michelon P. Solving the 0–1 multidimensional knapsack problem with resolution search. In: Workshop on Applied Combinatorial Optimization (VI ALIO/EURO) Buenos Aires, Argentina, December 2008.
4. A genetic algorithm for the multidimensional knapsack problem;Chu;Journal of Heuristics,1998
5. Gomes da Silva C, Climaco J, Figueira J. Core problems in bi-criteria 0,1-knapsack: new developments. Technical Report 12/2005, 2005 INESC-Coimbra.