References
- Jakobs, S., 1996, On Genetic Algorithms for the Packing of Polygons, European Journal of Operational Research, 88:1 165-181. https://doi.org/10.1016/0377-2217(94)00166-9
- Sul, L. H., Kang, T. J., 2002, Optimal Marking of Garment Pattern using Rectilinear Polygon Approximation, International Journal of Clothing Science and Technology, 14:5 334-346. https://doi.org/10.1108/09556220210446149
- Murata, H., Fujiyashi, K., Nakatake, S., Kajitani, Y., 1995, Rectangle Packing Based Module Placement, IEEE, Proc. of ICADD 95, 472-479.
- Yamazaki, H., Sakanushi, K., Kajitani, Y., 2000, Optimum Packing of Convex Polygons by a New Data Structure Sequence-table, IEEE APCCAS 2000, 821-824.
- Jain, S., Gea, H. C., 1996, Two Dimensional Packing Problem using Genetic Algorithm, Proceeding of the 1996 ASME, Design Engineering Technical Conference and Computers in Engineering Conference, 1-8.
- Glover, F., 1989, Tabu Search-Part 1, ORSA Journal on Computing, 1 190-206. https://doi.org/10.1287/ijoc.1.3.190
- Waggenspack, L., Dobson, G. T., 1996, Nesting of Complex 2-D Part within Irregular Boundaries, ASME, 118 1087-1357.
- Elkeran, A., 2013, A New Approach for Sheet Nesting Problem using Guided Cuckoo Search and Pairwise Clustering, European Journal of Operational Research, 231:3 757-769. https://doi.org/10.1016/j.ejor.2013.06.020
- Bennell, J., Olieira, J., 2008, The Geometry of Nesting Problem : A Tutorial, European Journal of Operational Research, 184:2 397-415. https://doi.org/10.1016/j.ejor.2006.11.038
- Rutenbar, R. A., 1989, Simulated Annealing Algorithms : An Overview, IEEE Circuits and Devices Magazine, 5 19-26. https://doi.org/10.1109/101.17235
- Laarhoven, P. J. M., Aarts, E. H. L., 1987, Simulated Annealing : Theory and Applications, Reidel Publisher, USA.
- Sugiura, H., Jang, S., Nakajima, N., 1992, Application of the Simulated Annealing Method to the 3-Dimensional Layout Design Problem, JSME, 91 1021-1043.
- Ginnenken, O., 1989, The Annealing Algorithm, Kluwer Academic Publisher, USA, 15-18.