An exact algorithm for large multiple knapsack problems

European Journal of Operational Research

Volumn 114, Issue 3, 1999, Pages 528-541

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Dynamic programming; Integer programming; Knapsack problem; Loading

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES;

CAPACITY CONSTRAINTS; MULTIPLE KNAPSACK PROBLEMS (MKP); RECURSIVE BRANCH-AND-BOUND ALGORITHMS;

STRATEGIC PLANNING;

EID: 0033132596     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00120-9     Document Type: Article

References (15)

1. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, UK, 1990.
2. Sinuany-Stern Z., Winer I. The one dimensional cutting stock problem using two objectives. Journal of the Operational Research Society. 45:1994;231-236.
3. Hung M.S., Fisk J.C. An algorithm for zero-one multiple knapsack problems. Naval Research Logistics Quarterly. 24:1978;571-579.
4. Martello S., Toth P. Solution of the zero-one multiple knapsack problem. European Journal of Operational Research. 4:1980;276-283.
5. A. Neebe, D. Dannenbring, Algorithms for a specialized segregated storage problem, Technical Report 77-5, University of North Carolina, Durham, NC, 1977.
6. N. Christofides, A. Mingozzi, P. Toth, In: N. Christofides, A. Mingozzi, P. Toth, C. Sandi (Eds.), Combinatorial Optimization, Wiley, Chichester, 1979, pp. 339-369.
7. Martello S., Toth P. A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics. 3:1981;275-288.
8. D. Pisinger, The Multiple Loading Problem, in: Proceedings NOAS'95, University of Reykjavík, Iceland, 18-19 August 1995.
9. Dantzig G.B. Discrete variable extremum problems. Operations Research. 5:1957;266-277.
10. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Operations Research. 28:1980;1130-1154.
11. Pisinger D. A minimal algorithm for the zero-one knapsack problem. Operations Research. 45:1997;758-767.
12. R.E. Bellman, Dynamic programming, Princeton University Press, Princeton, NJ, 1957.
13. D. Pisinger, An O(nr) algorithm for the subset sum problem, DIKU, University of Copenhagen, Denmark, Report 95-1, 1995. Available from http://www.diku.dk/research-groups/.
14. Horowitz E., Sahni S. Computing partitions with applications to the knapsack problem. Journal of ACM. 21:1974;277-292.
15. Dembo R.S., Hammer P.L. A reduction algorithm for knapsack problems. Methods of Operations Research. 36:1980;49-60.