1. Anderson, R. J., Mayr, E. W., & Warmuth, M. K. (1989). Parallel approximation algorithms for bin packing. Information and Computation, 82(3), 262–271.
2. Bansal, N., Han, X., Iwama, K., Sviridenko, M., & Zhang, G. (2007) Harmonic algorithm for 3-dimensional strip packing problem. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans (pp. 1197–2007).
3. Bekrar, A., & Kacem, I. (2009). An exact method for the 2D Guillotine strip packing problem. Advances in Operations Research. doi:10.1155/2009/732010. Article ID 732010.
4. Bender, M., Bradley, B., Jagannathan, G., & Pillaipakkamnatt, K. (2007) Sum-of-Squares Heuristics for Bin Packing and Memory Allocation. ACM Journal of Experimental Algorithmics, 12, 1–19. Article No. 2.3.
5. Berkey, J. O. (1990). The design and analysis of parallel algorithms for the one-dimensional bin packing problem. Ph. D. Dissertation, School of Information and Technology, George Mason University, Fairfax, VA.