Kernel search: A general heuristic for the multi-dimensional knapsack problem

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 2017-2026

  Angelelli, Enrico ^a   Mansini, Renata ^a   Grazia Speranza, M ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Binary variables; Heuristics; Kernel search; Multi dimensional knapsack problem

Indexed keywords

BENCH-MARK PROBLEMS; BINARY VARIABLES; COMBINATORIAL PROBLEM; CONTINUOUS RELAXATION; EXACT SOLUTION; KEY FEATURE; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PORTFOLIO OPTIMIZATION; STRONGLY NP-HARD; SUB-PROBLEMS;

FEATURE EXTRACTION; FINANCIAL DATA PROCESSING;

INTEGER PROGRAMMING;

EID: 77951114634     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.02.002     Document Type: Article

References (17)

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. Balas E., and Zemel E. An algorithm for large zero-one knapsack problems. Operations Research 28 (1980) 1130-1154
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. Chu P.C., and Beasley J.E. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4 (1998) 63-86
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.
6. Drexl A. A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40 (1988) 1-8
7. Fleszar K., and Hindi K.S. Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. Computers & OR 36 5 (2009) 1602-1607
8. Gilmore P.C., and Gomory R.E. The theory and computation of knapsack functions. Operations Research 14 (1966) 1045-1075
9. Glover F., and Kochenberger G.A. Critical event tabu search for multidimensional knapsack problems. In: Osman I.H., and Kelly J.P. (Eds). Metaheuristics: the theory and applications (1996), Kluwer Academic Publishers, Dordrecht 407-427
10. Hanafi S., and Fréville A. An efficient tabu search approach for the 0-1 multidimensional knapsack problem. European Journal of Operational Research 106 (1998) 659-675
11. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin, Germany
12. Mansini R., and Speranza M.G. A multidimensional knapsack model for the asset-backed securitization. Journal of the Operational Research Society 53 (2002) 822-832
13. Pisinger D. Core problems in knapsack algorithms. Operations Research 47 (1999) 570-575
14. Puchinger J, Raidl GR, Pferschy U. The core concept for the multidimensional knapsack problem. In Proceedings of the 6th European conference on evolutionary computation in combinatorial optimization (EvoCOP 06). Lecture notes in computer science, vol. 3906. Berlin: Springer; 2006. p. 195-208.
15. Shih W. A branch and bound method for the multiconstraint zero-one knapsack problem. Journal of the Operational Research Society 30 (1979) 369-378
16. Vasquez M., and Vimont Y. Improved results on the 0-1 multidimensional knapsack problem. European Journal of Operational Research 165 (2005) 70-81
17. Vimont Y., Boussier S., and Vasquez M. Reduced costs propagation in an efficient implicit enumeration for the 0-1 multidimensional knapsack problem. Journal of Combinatorial Optimization 15 (2008) 165-178