1. E.G. Coffman, M.R. Garey, D.S. Johnson, Approximation Algorithms for NP-Hard Problems, chap. 2 (PWS, Boston, 1995), pp. 46–93
2. M.R. Garey, D.S. Johnson, Approximation Algorithms for Bin Packing Problems A Survey (Springer, New York, 1981), pp. 147–172
3. E.G. Coffman, M.R. Garey, D.S. Johnson, Performance bounds for level oriented two dimensional packing algorithms. SIAM J. Comput. 9, 808 (1980)
4. A.L. Corcoran, R.L. Wainwright, in Proceedings of the ACM SIGAPP symposium on applied computing, Missouri. A Genetic Algorithm for Packing in Three Dimensions (1993), pp. 111–118
5. F.T.S. Chan, K.C. Au, L.Y. Chan, T.L. Lau, Using genetic algorithms to solve quality-related bin packing problem. Robot. Comput. Integr. Manuf. 23, 71–81 (2007)