Author:
Xu Yanxin,Yang Genke,Pan Changchun
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)
2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
3. Jakobs, S.: On genetic algorithms for the packing of polygons. European Journal of Operational Research 88(1), 165–181 (1996)
4. Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. European Journal of Operational Research 141(2), 359–370 (2002)
5. Burke, E.K., Hellier, R.S.R., Kendall, G., Whitwell, G.: Irregular Packing Using the Line and Arc No-Fit Polygon. Oper. Res. 58(4), 1–23 (2010)