A Minimal Algorithm for the Bounded Knapsack Problem

References

• Andonov R. , Poirriez V. , Rajopadhye S. Unbounded Knapsack Problem: Dynamic Programming Revisited, Technical Report IRISA, INRIA, Rennes, France. European Journal of Operational Research. (1997) . Also to appear in Google Scholar
• Balas E. , Zemel E. An Algorithm for Large Zero-One Knapsack Problems. Operations Research (1980) 28 1130 1154 Link, Google Scholar
• Bellman R.E. Dynamic Programming (1957) (Princeton University Press, Princeton, NJ) Google Scholar
• Bulfin R.L. , Parker R.G. , Shetty C.M. Computational Results with a Branch and Bound Algorithm for the General Knapsack Problem. Naval Research Logistics Quarterly (1979) 26 41 46 Crossref, Google Scholar
• Dembo R.S. , Hammer P.L. A Reduction Algorithm for Knapsack Problems. Methods of Operations Research (1980) 36 49 60 Google Scholar
• Gilmore P.C. , Gomory R.E. The Theory and Computation of Knapsack Functions. Operations Research (1966) 14 1045 1074 Link, Google Scholar
• Hoare C.A.R. Quicksort. Computer Journal (1962) 5 10 15 Crossref, Google Scholar
• Ingargiola G.P. , Korsh J.F. A General Algorithm for the One-Dimensional Knapsack Problem. Operations Research (1977) 25 752 759 Link, Google Scholar
• Martello S. , Toth P. , Roubens M. Branch and Bound Algorithms for the Solution of General Unidimensional Knapsack Problems. Advances in Operations Research (1977) (North-Holland, Amsterdam) 295 301 Google Scholar
• Martello S. , Toth P. A New Algorithm for the 0-1 Knapsack Problem. Management Science (1988) 34 633 644 Link, Google Scholar
• Martello S. , Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley, Chichester, England) Google Scholar
• Martello S. , Toth P. An Exact Algorithm for Large Unbounded Knapsack Problems. Operations Research Letters (1990) 9 15 20 Crossref, Google Scholar
• Nemhauser G.L. , Ullmann Z. Discrete Dynamic Programming and Capital Allocation. Management Science (1969) 15 494 505 Link, Google Scholar
• Pferschy U. (1998) . Dynamic Programming Revisited: Improved Knapsack Algorithms, Technical Report, Department of Business, University of Graz, Graz, Austria. (Also to appear in Computing Google Scholar
• Pisinger D. Core Problems in Knapsack Algorithms. Operations Research (1999) 47 570 575 Link, Google Scholar
• Pisinger D. A Minimal Algorithm for the Bounded Knapsack Problem Report 94/27. (1994) (DIKU, University of Copenhagen, Copenhagen, Denmark) Google Scholar
• Pisinger D. An Expanding-Core Algorithm for the Exact 0-1 Knapsack Problem. European Journal of Operational Research (1995) 87 175 187 Crossref, Google Scholar
• Pisinger D. A Minimal Algorithm for the Multiple-Choice Knapsack Problem. European Journal of Operational Research (1995) 83 394 410 Crossref, Google Scholar
• Pisinger D. , Balas E., Clausen J. A Minimal Algorithm for the Bounded Knapsack Problem. Integer Programming and Combinatorial Optimzation, Fourth IPCO Conference: Lecture Notes in Computer Science (1995) 920 (Springer, Berlin) 95 109 Google Scholar
• Pisinger D. A minimal Algorithm for the 0-1 Knapsack Problem. Operations Research (1997) 45 758 767 Link, Google Scholar
• Pisinger D. , Toth P. , Du D-Z., Pardalos P. Knapsack Problems. Handbook of Combinatorial Optimization (1998) 1 (Kluwer Academic Publishers, Dordrecht, the Netherlands) 299 428 Crossref, Google Scholar