Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound

European Journal of Industrial Engineering

Volumn 4, Issue 4, 2010, Pages 434-449

  Boyer, Vincent ^a,b   El Baz, Didier ^a,b   Elkihel, Moussa ^a,b  

^a LAAS ^*  (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

Branch and bound; Cooperative method; Dynamic programming; MKP; Multidimensionnal knapsack problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; HEURISTIC METHODS;

BRANCH-AND-BOUND ALGORITHMS; COOPERATIVE METHODS; DYNAMIC PROGRAMMING HEURISTICS; KNAPSACK PROBLEMS; MULTIDIMENSIONAL KNAPSACK PROBLEMS; OPTIMAL VALUES; TEST SETS;

BRANCH AND BOUND METHOD;

EID: 77958460910     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2010.035653     Document Type: Article

References (26)

1. Beasley, J.E. (1990) Multidimensional Knapsack Problem, OR-Library, available at http://people.brunel.ac.uk/~mastjjb/jeb/orlib-/mknapinfo.html.
2. Bellman, R. (1957) Dynamic Programming, Princeton University Press, Princeton.
3. Bertsimas, D. and Demir, R. (2002) 'An approximate dynamic-programming approach to multidimensional knapsack problem', Management Science, Vol. 4, pp.550-565.
4. Boyer, V. (2004) Méthodes et/ou Mixte pour la Programmation Linéaire en Variables 0-1, DEA report, LAAS-CNRS Toulouse, France.
5. Boyer, V., El Baz, D. and Elkihel, M. (2006) 'An efficient heuristics for the multidimensional knapsack problem', ROADEF'06, Presses Universitaires de Valenciennes, pp.95-106.
6. Boyer, V., El Baz, D. and Elkihel, M. (2008) 'Heuristics for the 0-1 multidimensional knapsack problem', European Journal of Operational Research, doi: 10.1016/j.ejor.2007.06.068.
7. Eilon, S. and Christofides, N. (1971) 'The loading problem', Management Science, Vol. 17, pp.259-268.
8. Elkihel, M., Authié, G. and Viader, F. (2002) 'An efficient hybrid dynamic algorithm to solve 0-1 knapsack problems', International Symposium on Combinatorial Optimization (CO'2002), Paris, France.
9. Fréville, A. (2004) 'The multidimensional 0-1 knapsack problem: an overview', European Journal of Operational Research, Vol. 155, pp.1-21.
10. Fréville, A. and Plateau, G. (1993) 'An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem', European Journal of Operational Research, Vol. 68, pp.413-421.
11. Fréville, A. and Plateau, G. (1994) 'An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem', Discrete Applied Mathematics, Vol. 49, pp.189-212.
12. Garfinkel, S. and Nemhauser, L. (1972) Integer Programming, Wiley Interscience.
13. Gavish, B. and Pirkul, H. (1982) 'Allocation of data bases and processors in a distributed computing system', Management of Distributed Computing Data Processing, Vol. 31, pp.215-231.
14. Gavish, B. and Pirkul, H. (1985) 'Efficient algorithms for solving multiconstraint 0-1 knapsack problems to optimality', Mathematical Programming, Vol. 31, pp.78-205.
15. Glover, F. (1968) 'Surrogate constraints', Operations Research, Vol. 16, pp.741-749.
16. Hanafi, S., Fréville, A. and El Abdellaoui, A. (1996) 'Meta-heuristics: theory and application, chapter comparaison of heuristics for the 0-1 multidimensional knapsack problem', Kluwer Academic, pp.446-465.
17. Kellerer, H., Pferschy, U. and Pisinger, D. (2004) Knapsack Problems, Springer.
18. Kolesar, P.J. (1967) 'A branch and bound algorithm for the knapsack problem', Management Science, Vol. 13, pp.723-735.
19. Lorie, J. and Savage, L.J. (1955) 'Three problems in capital rationing', The Journal of Business, Vol. 28, pp.229-239.
20. Martello, S. and Toth, P. (1982) 'A mixed algorithm for the subset-sum problem', EURO V, TIMS, Lausanne, France.
21. Martello, S. and Toth, P. (1990) Knapsack Problems - Algorithms and Computer Implementations, Wiley & Sons.
22. Martello, S., Pisinger, D. and Toth, P. (2000) 'New trends in exact algorithms for the 0-1 knapsack problem', European Journal of Operational Research, Vol. 123, pp.325-332.
23. Nemhauser, L. and Wolsey, A. (1988) Integer and Combinational Optimization, Wiley Interscience.
24. Osorio, M., Glover, F. and Hammer, P. (2002) 'Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions', Annals of Operations Research, Vol. 117, pp.71-93.
25. Plateau, G. and Elkihel, M. (1985) 'A hybrid method for the 0-1 knapsack problem', Methods of Operations Research, Vol. 49, pp.277-293.
26. Sherali, D. and Driscoll, J. (2000) 'Evolution and state-of-the-art in integer programing', Journal of Computational and Applied Mathematics, Vol. 124, pp.319-340.