The Knapsack Problem
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?
KeywordsScarce Resource Knapsack Problem Longe Path Investment Portfolio Customer Order
- 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 www.warehouse-science.com.Google Scholar
- Bellman, R. (1957) Dynamic Programming, Princeton University Press Princeton, N.J., Reprinted (2003) Dover Publications, Mineola, N.Y.Google Scholar
- Kellerer, H., U. Pferschy and D. Pisinger (2005) Knapsack Problems, Springer, Berlin, Germany.Google Scholar
- Martello, S. and P. Toth, (1990). Knapsack Problems: Algorithms and Computer Implementation, John Wiley, Ltd. This book is freely available at www.or.deis.unibo.it/knapsack.html.Google Scholar