1. Garey Garey, M.R. , M.R., and Johnson Johnson, D.S. , D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapter 4
2. Kellerer Kellerer, H. , H., Pferschy Pferschy, U. , U., and Pisinger Pisinger, D. , D. [2004]: Knapsack Problems. Springer, Berlin 2004
3. Martello Martello, S. , S., and Toth Toth, P. , P. [1990]: Knapsack Problems; Algorithms and Computer Implementations. Wiley, Chichester 1990
4. Papadimitriou Papadimitriou, C.H. , C.H., and Steiglitz Steiglitz, K. , K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Sections 16.2, 17.3, and 17.4
5. Balas Balas, E. , E., and Zemel Zemel, E. , E. [1980]: An algorithm for large zero-one knapsack problems. Operations Research 28 (1980), 1130–1154