The Knapsack Problem

  • John J. BartholdiIII
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 115)

The “knapsack problem” appears in many forms in economics, engineering, and business: any place where one must allocate a single scarce resource among multiple contenders for that resource. It has acquired the fanciful name “knapsack problem” because our common experience of packing luggage expresses something of the flavor of the problem: What should be chosen when space is limited?


Scarce Resource Knapsack Problem Longe Path Investment Portfolio Customer Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Selected Bibliography

  1. Bartholdi, J. J. III and S.T. Hackman, (2006). Warehouse and Distribution Sciences. Georgia Institute of Technology, Altanta, GA. This book is freely available at Scholar
  2. Bellman, R. (1957) Dynamic Programming, Princeton University Press Princeton, N.J., Reprinted (2003) Dover Publications, Mineola, N.Y.Google Scholar
  3. Dantzig, G. (1957). “Discrete variable extremum problems”, Operations Research 5,266–277.CrossRefGoogle Scholar
  4. Diffie, W. and M. Helman, (1976) “New directions in cryptography”, IEEE Transactions on Information Theory 22(6):644–654.CrossRefGoogle Scholar
  5. Ibarra, O. H. and C. E. Kim, (1975) “Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems”, Journal of ACM 22,463–468.CrossRefGoogle Scholar
  6. Kellerer, H., U. Pferschy and D. Pisinger (2005) Knapsack Problems, Springer, Berlin, Germany.Google Scholar
  7. Martello, S. and P. Toth, (1990). Knapsack Problems: Algorithms and Computer Implementation, John Wiley, Ltd. This book is freely available at Scholar
  8. Merkle, R. and M. Helman, (1978). “Hiding information and signatures in trapdoor knapsacks”, IEEE Transactions on Information Theory 24(5),525–530.CrossRefGoogle Scholar
  9. Sahni, S. (1975). “Approximate algorithms for the 0–1 knapsack problem”, Journal of ACM 22:115–124.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • John J. BartholdiIII

There are no affiliations available

Personalised recommendations