1. Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines—a stochastic approach to combinatorial optimization and neural computing. New York: Wiley.
2. Brunetta, L., & Grégoire, Ph. (2005). A general purpose algorithm for three-dimensional packing. INFORMS Journal on Computing, 17(3), 328–338.
3. Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: A survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems. Boston: PWS Publishing Company.
4. Coffman, E. G., Galambos, G., Martello, S., & Vigo, D. (1999). Packing approximation algorithms: Combinatorial analysis. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization. Dordrecht: Kluwer Academic.
5. Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, 145–159.