1. András, P., András, A., Zsuzsa, S., 1996. A genetic solution for the cutting stock problem. In: Chawdry, P.K., Roy, R., Kant, R.K. (Eds.), Proceedings of the First On-line Workshop on Soft Computing. Springer, Berlin, pp. 87–92
2. Orthogonal packing in two dimensions;Baker;SIAM Journal of Computing,1980
3. Burke, E., Kendall, G., 1998. Comparison of meta-heuristic algorithms for clustering rectangles. In: Proceedings of the 24th International Conference on Computers and Industrial Engineering. Uxbridge, UK, to appear
4. The bottom-left bin-packing heuristic: An efficient implementation;Chazelle;IEEE Transactions on Computers,1983
5. Approximation algorithms for bin-packing – an updated survey;Coffman,1984