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