{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T06:41:48Z","timestamp":1781678508534,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T00:00:00Z","timestamp":1388188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10898-013-0129-z","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T10:49:30Z","timestamp":1388141370000},"page":"367-404","source":"Crossref","is-referenced-by-count":38,"title":["A fully general, exact algorithm for nesting irregular shapes"],"prefix":"10.1007","volume":"59","author":[{"given":"Donald R.","family":"Jones","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,28]]},"reference":[{"issue":"5","key":"129_CR1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","volume":"SMC\u201310","author":"A Albano","year":"1980","unstructured":"Albano, A., Sapuppo, G.: Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Syst. Cybern. SMC\u201310(5), 242\u2013248 (1980)","journal-title":"IEEE Trans. Syst. Cybern."},{"issue":"1","key":"129_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/1989230100051","volume":"23","author":"F Avnaim","year":"1989","unstructured":"Avnaim, F., Boissonnat, J.: Polygon placement under translation and rotation. Informatique theorique et applications 23(1), 5\u201328 (1989)","journal-title":"Informatique theorique et applications"},{"issue":"1","key":"129_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"JA Bennel","year":"2009","unstructured":"Bennel, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60(1), 93\u2013105 (2009)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"129_CR4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/opre.1060.0293","volume":"54","author":"E Burke","year":"2006","unstructured":"Burke, E., Hellier, R., Kendall, G., Whitwell, G.: A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. 54(3), 587\u2013601 (2006)","journal-title":"Oper. Res."},{"key":"129_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"279","author":"E Burke","year":"2007","unstructured":"Burke, E., Hellier, R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 279, 27\u201349 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"129_CR6","first-page":"382","volume":"99","author":"F Chin","year":"1995","unstructured":"Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discret. Comput. Geomet. 99(3), 382\u2013391 (1995)","journal-title":"Discret. Comput. Geomet."},{"key":"129_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ejor.2007.09.012","volume":"192","author":"MT Costa","year":"2009","unstructured":"Costa, M.T., Gomes, A.M., Oliveira, J.F.: Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet. Eur. J. Oper. Res. 192, 29\u201340 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"129_CR8","unstructured":"Daniels, K., Milenkovic, V.: Multiple translational containment: approximate and exact algorithms. In: Clarkson, K. (ed.) Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995)"},{"key":"129_CR9","doi-asserted-by":"crossref","unstructured":"Daniels, K., Milenkovic, V.: Column-based strip packing using ordered and compliant containment. In: Lin, M.C., Manocha, D. (eds.) Proceedings of the First ACM Workshop on Applied Computational Geometry (WACG), pp. 33\u201338 (1996)","DOI":"10.1007\/BFb0014488"},{"key":"129_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)"},{"key":"129_CR11","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","volume":"84","author":"K Dowsland","year":"1995","unstructured":"Dowsland, K., Dowsland, W.: Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506\u2013521 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"129_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1057\/jors.1988.6","volume":"39","author":"AA Farley","year":"1988","unstructured":"Farley, A.A.: Mathematical models for cutting-stock problems in the clothing industry. J. Oper. Res. Soc. 39(1), 41\u201353 (1988)","journal-title":"J. Oper. Res. Soc."},{"key":"129_CR13","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Visweswaran, V.: Handbook of Global Optimization, chap. Quadratic Optimization, pp. 217\u2013270. Kluwer, Berlin (1995)","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"129_CR14","unstructured":"Heistermann, J., Lengauer, T.: Efficient automatic part nesting on irregular and inhomogeneous surfaces. In: Ramachandran, V. (ed.) Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 251\u2013259 (1993)"},{"key":"129_CR15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-007-9274-6","volume":"43","author":"J Kallrath","year":"2009","unstructured":"Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim. 43, 299\u2013328 (2009)","journal-title":"J. Glob. Optim."},{"key":"129_CR16","doi-asserted-by":"crossref","unstructured":"Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. (2013). doi: 10.1007\/s10898-013-0125-3","DOI":"10.1007\/s10898-013-0125-3"},{"issue":"3","key":"129_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0010-4485(96)00065-6","volume":"29","author":"H Lamousin","year":"1997","unstructured":"Lamousin, H., Waggenspack Jr, W.N.: Nesting of two-dimensional irregular parts using a shape reasoning heuristic. Comput. Aided Des. 29(3), 221\u2013238 (1997)","journal-title":"Comput. Aided Des."},{"key":"129_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00934543","volume":"39","author":"JB Lasserrre","year":"1983","unstructured":"Lasserrre, J.B.: An analytical expression and an algorithm for the volume of a convex polyhedron in $${R}^{n}$$ R n . J. Optim. Theory Appl. 39, 363\u2013377 (1983)","journal-title":"J. Optim. Theory Appl."},{"key":"129_CR19","unstructured":"Li, Z.: Compaction algorithms for non-convex polygons and their applications. Ph.D. thesis, Harvard University, Department of Computer Science (1994)"},{"key":"129_CR20","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","volume":"84","author":"Z Li","year":"1995","unstructured":"Li, Z., Milenkovic, V.: Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84, 539\u2013561 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"129_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(99)00006-1","volume":"13","author":"V Milenkovic","year":"1999","unstructured":"Milenkovic, V.: Rotational polygon containment and minimum enclosure using only robust 2d constructions. Comput. Geom. 13, 3\u201319 (1999)","journal-title":"Comput. Geom."},{"key":"129_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0925-7721(01)00051-7","volume":"22","author":"V Milenkovic","year":"2002","unstructured":"Milenkovic, V.: Densest translational lattice packing of non-convex polygons. Comput. Geom. 22, 205\u2013222 (2002)","journal-title":"Comput. Geom."},{"key":"129_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57, 3\u201350 (2013)","journal-title":"J. Glob. Optim."},{"key":"129_CR24","volume-title":"Computational Geometry in C","author":"J O\u2019Rourke","year":"2001","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"129_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Berlin (1985)"},{"issue":"2","key":"129_CR26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"129_CR27","doi-asserted-by":"crossref","unstructured":"Verkhoturov, M.A., Sergeyeva, O.Y.: The sequential value correction method for the two-dimensional irregular cutting stock problem. Pesquisa Operacional 20(2), 233\u2013246 (2000)","DOI":"10.1590\/S0101-74382000000200007"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0129-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0129-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0129-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T11:01:06Z","timestamp":1565002866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0129-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,28]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0129-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,28]]}}}