Core problems in knapsack algorithms

Operations Research

Volumn 47, Issue 4, 1999, Pages 570-575

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

KNAPSACK ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0032594154     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.4.570     Document Type: Article

References (11)

1. Balas, E., E. Zemel. 1980. An algorithm for large zero-one knapsack problems. Oper. Res. 28 1130-1154.
2. Dembo, R. S., P. L. Hammer. 1980. A reduction algorithm for knapsack problems. Methods of Oper. Res. 36 49-60.
3. Fayard, D., G. Plateau. 1982. An algorithm for the solution of the 0-1 knapsack problem. Computing 28 269-287.
4. Ingargiola, G. P., J. F. Korsh. 1973. A reduction algorithm for zero-one single knapsack problems. Management Sci. 20 460-463.
5. Martello, S., P. Toth. 1977. An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European J. Oper. Res. 1 169-175.
6. _, _. 1988. A new algorithm for the 0-1 knapsack problem. Management Sci. 34 633-644.
7. _, _. 1990. Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester, England.
8. Pisinger, D. 1994. Core problems in knapsack algorithms. Report 94/26. DIKU, University of Copenhagen, Denmark.
9. _. 1995a. An expanding-core algorithm for the exact 0-1 knapsack problem. European J. Oper. Res. 87 175-187.
10. _. 1995b. Avoiding anomalies in the MT2 algorithm by Martello and Toth. European J. Oper. Res. 82 206-208.
11. _. 1997. A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45 758-767.