New trends in exact algorithms for the 0-1 knapsack problem

European Journal of Operational Research

Volumn 123, Issue 2, 2000, Pages 325-332

  Martello, Silvano ^a   Pisinger, David ^b   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

BRANCH AND BOUND PROBLEM; CARDINALITY CONSTRAINTS; KNAPSACK PROBLEM; RUDIMENTARY DIVISIBILITY;

OPTIMIZATION;

EID: 0033894212     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00260-X     Document Type: Article

References (16)

1. E. Balas, E. Zemel, An algorithm for large zero-one knapsack problems, Operations Research 28 (1980) 1130-1154.
2. R.E. Bellman, Dynamic Programming, Princeton University Press, Princeton, NJ, 1957.
3. G.B. Dantzig, Discrete variable extremum problems, Operations Research 5 (1957) 266-277.
4. D. Fayard, G. Plateau, Resolution of the 0-1 knapsack problem: Comparison of methods, Mathematical Programming 8 (1975) 272-307.
5. D. Fayard, G. Plateau, An algorithm for the solution of the 0-1 knapsack problem, Computing 28 (1982) 269-287.
6. A. Freville, G. Plateau, An exact search for the solution of the surrogate dual of the 0-1 bi-dimensional knapsack problem, European Journal of Operational Research 68 (1993) 413-421.
7. E. Horowitz, S. Sahni, Computing partitions with applications to the knapsack problem, Journal of ACM 21 (1974) 277-292.
8. S. Martello, D. Pisinger, P. Toth, Dynamic programming and strong bounds for the 0-1 knapsack problem, Management Science 45 (1999) 414-424.
9. S. Martello, P. Toth, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, European Journal of Operational Research 1 (1977) 169-175.
10. S. Martello, P. Toth, A new algorithm for the 0-1 knapsack problem, Management Science 34 (1988) 633-644.
11. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, UK, 1990.
12. S. Martello, P. Toth, Upper bounds and algorithms for hard 0-1 knapsack problems, Operations Research 45 (1997) 768-778.
13. R.M. Nauss, An efficient algorithm for the 0-1 knapsack problem, Management Science 23 (1976) 27-31.
14. D. Pisinger, An expanding-core algorithm for the exact 0-1 knapsack problem, European Journal of Operational Research 87 (1995) 175-187.
15. D. Pisinger, A minimal algorithm for the 0-1 knapsack problem, Operations Research 45 (1997) 758-767.
16. G. Plateau, M. Elkihel, A hybrid method for the 0-1 knapsack problem, Methods of Operations Research 49 (1985) 277-293.