1. Beasley, J. E. (2000). A population heuristic for constrained two-dimensional non-guillotine cutting. Working paper available from the author at The Management School, Imperial College, London SW7 2AZ, England
2. Corno, F., Prinetto, P., Rebaudengo, M., & Sonza Reorda, M. (1997). Optimizing area loss in flat glass cutting. In GALESIA97, IEE/IEEE international conference on genetic algorithms in engineering systems: Innovations and applications, Glasgow, UK
3. Threshold accepting a general purpose optimization algorithm appearing superior to simulated annealing;Dueck;Journal of Computing Physics,1990
4. Cutting stock by iterated matching;Fritsch,1995
5. An exact algorithm for general, orthogonal, two-dimensional knapsack problems;Hadjiconstantinou;European Journal of Operational Research,1995