{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T09:53:55Z","timestamp":1769075635755,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T00:00:00Z","timestamp":1398816000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10898-014-0192-0","type":"journal-article","created":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T04:56:05Z","timestamp":1398747365000},"page":"497-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Optimal clustering of a pair of irregular objects"],"prefix":"10.1007","volume":"61","author":[{"given":"J.","family":"Bennell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Scheithauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Stoyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Romanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pankratov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,30]]},"reference":[{"issue":"1","key":"192_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0010-4485(76)90006-3","volume":"8","author":"M Adamowicz","year":"1976","unstructured":"Adamowicz, M., Albano, A.: Nesting two-dimensional shapes in rectanglular modules. Comput. Aided Des. 8(1), 27\u201333 (1976)","journal-title":"Comput. Aided Des."},{"issue":"1","key":"192_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.D.: Polygon placement under translation and rotation. Informatique Theorique et Applications 23(1), 5\u201328 (1989)","journal-title":"Informatique Theorique et Applications"},{"key":"192_CR3","doi-asserted-by":"crossref","unstructured":"Avnaim, F., Boissonnat, J.D.: Simultaneous containment of several polygons. In: Symposium on Computational Geometry, pp. 242\u2013247 (1987)","DOI":"10.1145\/41958.41984"},{"key":"192_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184, 397\u2013415 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"192_CR5","doi-asserted-by":"crossref","first-page":"s93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"JA Bennell","year":"2009","unstructured":"Bennell, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problem. J. Oper. Res. Soc. 60, s93\u2013s105 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"192_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-008-0456-5","volume":"179","author":"J Bennell","year":"2008","unstructured":"Bennell, J., Scheithauer, G., Stoyan, Y., Romanova, T.: Tools of mathematical modeling of arbitrary object packing problems. Ann. OR 179, 343\u2013368 (2008)","journal-title":"Ann. OR"},{"issue":"4","key":"192_CR7","first-page":"60","volume":"14","author":"J Blazewicz","year":"1989","unstructured":"Blazewicz, J., Drozdowski, M., Soniewicki, B., Walkowiak, R.: Two-dimensional cutting problem\u2014basic complexity results and algorithms for irregular shapes. Found. Cont. Eng. 14(4), 60\u2013137 (1989)","journal-title":"Found. Cont. Eng."},{"issue":"4","key":"192_CR8","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1287\/opre.1090.0770","volume":"58","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hellier, R., Kendall, G., Whitwell, G.: Irregular packing using the line and arc no-fit polygon. Oper. Res. 58(4), 948\u2013970 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"192_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02187720","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discret. Comput. Geom. 4(2), 139\u2013181 (1989)","journal-title":"Discret. Comput. Geom."},{"key":"192_CR10","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.comgeo.2009.12.003","volume":"43","author":"N Chernov","year":"2010","unstructured":"Chernov, N., Stoyan, Yu., Romanova, T.: Mathematical model and efficient algorithms for object packing problem. Comput. Geom. Theory Appl. 43, 535\u2013553 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"key":"192_CR11","doi-asserted-by":"crossref","unstructured":"Chernov, N., Stoyan, Yu., Romanova, T., Pankratov, A.: Phi-functions for 2D objects formed by line segments and circular arcs. Adv. Oper. Res. (2012). doi: 10.1155\/2012\/346358","DOI":"10.1155\/2012\/346358"},{"key":"192_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jda.2009.02.002","volume":"7","author":"M Chlebik","year":"2009","unstructured":"Chlebik, M., Chlebikova, J.: Hardness of approximation for orthogonal rectangle packing and covering problems. J. Discret. Algorithms 7, 291\u2013305 (2009)","journal-title":"J. Discret. Algorithms"},{"key":"192_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(83)90040-3","volume":"24","author":"D Dori","year":"1983","unstructured":"Dori, D., Ben-Bassat, M.: Circumscribing a convex polygon by a polygon of fewer sides with minimal area additions. Comput. Vis. Graph. Image Process. 24, 131\u2013159 (1983)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"192_CR14","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","volume":"84","author":"KA Dowsland","year":"1995","unstructured":"Dowsland, K.A., Dowsland, W.B.: Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84, 506\u2013521 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"192_CR15","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0377-2217(94)00279-7","volume":"92","author":"RB Grinde","year":"1996","unstructured":"Grinde, R.B., Cavalier, T.M.: Containment of a single polygon using mathematical programming. Eur. J. Oper. Res. 92, 368\u2013386 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"192_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0305-0548(96)00050-0","volume":"24","author":"RB Grinde","year":"1997","unstructured":"Grinde, R.B., Cavalier, T.M.: A new algorithm for the two-polygon containment problem. Comput. Oper. Res. 24, 231\u2013251 (1997)","journal-title":"Comput. Oper. Res."},{"key":"192_CR17","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/0377-2217(95)00020-Q","volume":"84","author":"RB Grinde","year":"1995","unstructured":"Grinde, R.B., Cavalier, T.M.: A new algorithm for the minimum-area convex enclosing problem. Eur. J. Oper. Res. 84, 522\u2013538 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"192_CR18","doi-asserted-by":"crossref","unstructured":"Han, W., Bennell, J.A., Song, X., Zhao, X.: Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. Eur. J. Oper. Res. (2013). doi: 10.1016\/j.ejor.2013.04.048","DOI":"10.1016\/j.ejor.2013.04.048"},{"key":"192_CR19","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":"192_CR20","unstructured":"Li, Z., Milenkovic, V.: The complexity of the compaction problem. In: 5th Canadian Conference on Computational Geometry, Univ. Waterloo (1993)"},{"issue":"9","key":"192_CR21","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0010-4485(88)90040-1","volume":"20","author":"RR Martin","year":"1988","unstructured":"Martin, R.R., Stephenson, P.C.: Putting objects into boxes. Comput. Aided Des. 20(9), 506\u2013514 (1988)","journal-title":"Comput. Aided Des."},{"issue":"9","key":"192_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/PL00014416","volume":"19","author":"V Milenkovic","year":"1997","unstructured":"Milenkovic, V.: Multiple translational containment. Part II: Exact algorithms. Algorithmica 19(9), 183\u2013218 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"192_CR23","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(1), 3\u201319 (1999)","journal-title":"Comput. Geom."},{"issue":"4","key":"192_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0925-7721(98)00012-1","volume":"10","author":"V Milenkovic","year":"1998","unstructured":"Milenkovic, V.: Rotational polygon overlap minimization and compaction. Comput. Geom. 10(4), 305\u2013318 (1998)","journal-title":"Comput. Geom."},{"issue":"5","key":"192_CR25","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1111\/j.1475-3995.1999.tb00171.x","volume":"6","author":"V Milenkovic","year":"1999","unstructured":"Milenkovic, V., Daniels, K.: Translational polygon containment and minimal enclosure using mathematical programming. Int. Trans. Oper. Res. 6(5), 525\u2013554 (1999)","journal-title":"Int. Trans. Oper. Res."},{"key":"192_CR26","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1142\/S0218195910003402","volume":"20","author":"V Milenkovic","year":"2010","unstructured":"Milenkovic, V., Sacks, E.: Two approximate Minkowski sum algorithms. Int. J. Comput. Geom. Appl. 20, 485\u2013509 (2010)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"192_CR27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A Wachter","year":"2006","unstructured":"Wachter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"192_CR28","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher, G., Hauner, H., Schuma, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0192-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0192-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0192-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T23:41:50Z","timestamp":1565394110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0192-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,30]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["192"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0192-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,30]]}}}