A minimal algorithm for the 0-1 knapsack problem

Operations Research

Volumn 45, Issue 5, 1997, Pages 758-767

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

KNAPSACK PROBLEMS (KP);

OPERATIONS RESEARCH;

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

References (15)

1. BALAS, E. AND E. ZEMEL. 1980. An Algorithm for Large Zero-One Knapsack Problems. Opus. Res. 28, 1130-1154.
2. BELLMAN, R. E. 1957. Dynamic Programming. Princeton University Press, Princeton, NJ.
3. DEMBO, R. S. AND P. L. HAMMER. 1980. A Reduction Algorithm for Knapsack Problems. Methods Oper. Res. 36, 49-60.
4. FAYARD, D. AND G. PLATEAU. 1982. An Algorithm for the Solution of the 0-1 Knapsack Problem. Computing, 28, 269-287.
5. HOROWITZ, E. AND S. SAHNI. 1974. Computing Partitions with Applications to the Knapsack Problem, J. ACM, 21, 277-292.
6. MARTELLO, S. AND P. TOTH. 1977. An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm. Eur. J. Opnl Res. 1, 169-175.
7. MARTELLO, S. AND P. TOTH. 1988. A New Algorithm for the 0-1 Knapsack Problem. Mgmt. Sci. 34, 633-644.
8. MARTELLO, S. AND P. TOTH. 1990. Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester, England.
9. MARTELLO, S. AND P. TOTH. 1993. Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems. Research Report DEIS, University of Bologna.
10. NAUSS, R. M. 1976. An Efficient Algorithm for the 0-1 Knapsack Problem. Mgmt. Sci. 23, 27-31.
11. PISINGER, D. 1993. On the Solution of 0-1 Knapsack Problems with Minimal Preprocessing. Proceedings NOAS'93, Trondheim, Norway.
12. PISINGER, D. 1995a. An Expanding-core Algorithm for the Exact 0-1 Knapsack Problem. Eur. J. Opnl. Res. 87, 175-187.
13. PISINGER, D. 1995b. A Minimal Algorithm for the Multiple-choice Knapsack Problem. Eur. J. Opnl. Res. 83, 394-410.
14. PISINGER, D. 1995c. A Minimal Algorithm for the Bounded Knapsack Problem. In Integer Programming and Combinatorial Optimization, Fourth IPCO conference. E. Balas and J. Clausen (eds.), Lecture Notes in Computer Science, Springer, Berlin, 920, 95-109.
15. PISINGER, D. 1995d. Algorithms for Knapsack Problems. Ph.D. Thesis, DIKU, University of Copenhagen, Report 95/1.