1. Computers and intractabililty: a guide to the theory of NP-completeness;Garey,1979
2. Knapsack problems: algorithms and computer implementations;Martello,1990
3. BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem;Scholl;Computers & Operations Research,1997
4. A new lower bound for the bin-packing problem and its integration into MTP and BISON;Schwerin;Pesquisa Operacional,1999
5. Coffman E, Garey M, Johnson D. Approximation algorithms for bin packing: a survey in: Approximation algorithms for NP-hard problems [D. Hochbaum, editor], vol. 46–93. Boston, MA: PWS Publishing; 1997.