The core concept for the multidimensional Knapsack problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 195-208

  Puchinger, Jakob ^a   Raidl, Günther R ^a   Pferschy, Ulrich ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

METAHEURISTICS; MULTIDIMENSIONAL KNAPSACK PROBLEM (MKP); RUN-TIME; VARIABLE NEIGHBORHOOD;

OPERATIONS RESEARCH;

EID: 33745769989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_17     Document Type: Conference Paper

References (19)

1. E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research, 28:1130-1154, 1980.
2. D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997.
3. P. C. Chu and J. Beasley. A genetic algorithm for the multiconstrained knapsack problem. Journal of Heuristics, 4:63-86, 1998.
4. A. Fréville and G. Plateau. An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discrete Applied Mathematics, 49:189-212, 1994.
5. F. Glover and G. Kochenberger. Critical event tabu search for multidimensional knapsack problems. In I. Osman and J. Kelly, editors, Metaheuristics: Theory and Applications, pages 407-427. Kluwer Academic Publishers, 1996.
6. J. Gottlieb. On the effectivity of evolutionary algorithms for multidimensional knapsack problems. In C. Fonluptet al., editors, Proceedings of Artificial Evolution: Fourth European Conference, volume 1829 of LNCS, pages 22-37. Springer, 1999.
7. P. Hansen and N. Mladenović. An introduction to variable neighborhood search. In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, pages 433-458. Kluwer, 1999.
8. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
9. S. Martello and P. Toth. A new algorithm for the 0-1 knapsack problem. Management Science, 34:633-644, 1988.
10. H. Pirkul. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics, 34:161-172, 1987.
11. D. Pisinger. An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research, 87:175-187, 1995.
12. D. Pisinger. A minimal algorithm for the 0-1 knapsack problem. Operations Research, 45:758-767, 1997.
13. D. Pisinger. Core problems in knapsack algorithms. Operations Research, 47:570-575, 1999.
14. J. Puchinger and G. R. Raidl. Relaxation guided variable neighborhood search. In P. Hansen, N. Mladenović, J. A. M. Pérez, B. M. Batista, and J. M. Moreno-Vega, editors, Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain, 2005.
15. G. R. Raidl. An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. In D. Fogel et al., editors, Proceedings of the 5th IEEE International Conference on Evolutionary Computation, pages 207-211. IEEE Press, 1998.
16. 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 Journal, 13(4), to appear 2005.
17. S. Senju and Y. Toyoda. An approach to linear programming with 0-1 variables. Management Science, 15:196-207, 1968.
18. M. Vasquez and J.-K. Hao. A hybrid approach for the 0-1 multidimensional knapsack problem. In Proceedings of the Int. Joint Conference on Artificial Intelligence 2001, pages 328-333, 2001.
19. M. Vasquez and Y. Vimont. Improved results on the 0-1 multidimensional knapsack problem. European Journal of Operational Research, 165:70-81, 2005.