{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:50:59Z","timestamp":1772164259838,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030335847","type":"print"},{"value":"9783030335854","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T00:00:00Z","timestamp":1572134400000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-33585-4_21","type":"book-chapter","created":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T12:03:38Z","timestamp":1572091418000},"page":"214-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Decomposition Algorithm for Irregular Placement Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-4917","authenticated-orcid":false,"given":"T.","family":"Romanova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8053-0276","authenticated-orcid":false,"given":"Yu.","family":"Stoyan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2958-8923","authenticated-orcid":false,"given":"A.","family":"Pankratov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1850-4755","authenticated-orcid":false,"given":"I.","family":"Litvinchev","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-9828","authenticated-orcid":false,"given":"J. A.","family":"Marmolejo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher, G., Hauner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","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. Discrete Computat. Geom. 4(2), 139\u2013181 (1989)","journal-title":"Discrete Computat. Geom."},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M., Alvarez-Vald\u00e9s, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. (2019) \n                  https:\/\/doi.org\/10.1016\/j.ejor.2019.04.045","DOI":"10.1016\/j.ejor.2019.04.045"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-18899-7_9","volume-title":"Optimized Packings with Applications","author":"Igor Litvinchev","year":"2015","unstructured":"Litvinchev, I., Infante, L., Ozuna, L.: Approximate packing: integer programming models, valid inequalities and nesting. In: Fasano, G., Pinter, J.D., (eds.) Optimized Packings and their Applications. Springer Optimization and its Applications, vol. 105, pp. 117\u2013135 (2015)"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10898-013-0125-3","volume":"59","author":"J Kallrath","year":"2014","unstructured":"Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Global Optim. 59(2), 405\u2013437 (2014)","journal-title":"J. Global Optim."},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-015-0395-z","volume":"65","author":"EG Birgin","year":"2016","unstructured":"Birgin, E.G., Lobato, R.D., Martinez, J.M.: Packing ellipsoids by nonlinear optimization. J. Global Optim. 65(4), 709\u2013743 (2016)","journal-title":"J. Global Optim."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1134\/S1064230715020070","volume":"54","author":"I Litvinchev","year":"2015","unstructured":"Litvinchev, I., Infante, L., Ozuna, L.: Packing circular like objects in a rectangular container. J. Comput. Syst. Sci. Int. 54(2), 259\u2013267 (2015)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1869-y","author":"R Torres","year":"2018","unstructured":"Torres, R., Marmolejo, J.A., Litvinchev, I.: Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Netw. (2018). \n                  https:\/\/doi.org\/10.1007\/s11276-018-1869-y","journal-title":"Wirel. Netw."},{"issue":"1","key":"21_CR9","first-page":"1","volume":"8","author":"H Alt","year":"2017","unstructured":"Alt, H., Berg, M., Knauer, C.: Approximating minimum-area rectangular and convex containers for packing convex polygons. J. Comput. Geom. 8(1), 1\u201310 (2017)","journal-title":"J. Comput. Geom."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-013-0129-z","volume":"59","author":"D Jones","year":"2013","unstructured":"Jones, D.: A fully general, exact algorithm for nesting irregular shapes. J. Global Optim. 59, 367\u2013404 (2013)","journal-title":"J. Global Optim."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.ijpe.2013.04.007","volume":"145","author":"R Alvarez-Valdes","year":"2013","unstructured":"Alvarez-Valdes, R., Martinez, A., Tamarit, J.: A branch and bound algorithm for cutting and packing irregularly shaped pieces. Int. J. Prod. Econ. 145, 463\u2013477 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"Part 1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2012.03.026","volume":"163","author":"R Baldacci","year":"2014","unstructured":"Baldacci, R., Boschetti, M.A., Ganovelli, M., Maniezzo, V.: Algorithms for nesting with defects. Discrete Appl. Math. 163(Part 1), 17\u201333 (2014)","journal-title":"Discrete Appl. Math."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10898-018-0638-x","volume":"72","author":"LH Cherri","year":"2018","unstructured":"Cherri, L.H., Cherri, A.C., Soler, E.M.: Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. J. Global Optim. 72, 89\u2013107 (2018)","journal-title":"J. Global Optim."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1080\/00207543.2015.1041571","volume":"54","author":"AA Leao","year":"2016","unstructured":"Leao, A.A., Toledo, F.M., Oliveira, J.F., Carravilla, M.A.: A semi-continuous MIP model for the irregular strip packing problem. Int. J. Prod. Res. 54, 712\u2013721 (2016)","journal-title":"Int. J. Prod. Res."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1590\/0101-7438.2018.038.02.0195","volume":"38","author":"J Peralta","year":"2018","unstructured":"Peralta, J., Andretta, M., Oliveira, J.F.: Solving irregular strip packing problems with free rotations using separations lines. Pesquisa Operacional 38, 195\u2013214 (2018)","journal-title":"Pesquisa Operacional"},{"key":"21_CR16","series-title":"Solution Methods. International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64403-5","volume-title":"Introduction to Cutting and Packing Optimization - Problems, Modeling Approaches","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization - Problems, Modeling Approaches. Solution Methods. International Series in Operations Research & Management Science, 1st edn. Springer, Berlin (2018)","edition":"1"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/s10898-018-0637-y","volume":"71","author":"A Wang","year":"2018","unstructured":"Wang, A., Hanselman, C.L., Gounaris, C.E.: A customized branch-and-bound approach for irregular shape nesting. J. Global Optim. 71, 935\u2013955 (2018)","journal-title":"J. Global Optim."},{"key":"21_CR18","series-title":"Springer Briefs in Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05005-8","volume-title":"Solving Non-standard Packing Problems by Global Optimization and Heuristics","author":"G Fasano","year":"2014","unstructured":"Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer Briefs in Optimization. Springer, New York (2014)"},{"key":"21_CR19","series-title":"Springer Optimization and its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18899-7","volume-title":"Optimized Packings and their Applications","author":"G Fasano","year":"2015","unstructured":"Fasano, G., Pint\u00e9r, J.D.: Optimized Packings and their Applications. Springer Optimization and its Applications. Springer, New York (2015)"},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"140","DOI":"10.7315\/JCDE.2014.014","volume":"1","author":"J Youn-Kyoung","year":"2014","unstructured":"Youn-Kyoung, J., Sang, D.N.: Intelligent 3D packing using a grouping algorithm for automotive container engineering. J. Comp. Design Eng. 1(2), 140\u2013151 (2014)","journal-title":"J. Comp. Design Eng."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11590-015-0937-9","volume":"10","author":"P Stetsyuk","year":"2016","unstructured":"Stetsyuk, P., Romanova, T., Scheithauer, G.: On the global minimum in a balanced circular packing problem. Optim. Lett. 10, 347\u20131360 (2016)","journal-title":"Optim. Lett."},{"key":"21_CR22","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4614-4469-5_15","volume-title":"Modeling and Optimization in Space Engineering","author":"Yu Stoyan","year":"2012","unstructured":"Stoyan, Yu., Romanova, T.: Mathematical models of placement optimization: two- and three-dimensional problems and applications. In: Fasano, G., Pinter, J.D. (eds.) Modeling and Optimization in Space Engineering. Springer Optimization and Its Applications, vol. 73, pp. 363\u2013388. Springer, Berlin (2012)"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10898-015-0331-2","volume":"65","author":"Yu Stoyan","year":"2016","unstructured":"Stoyan, Yu., Pankratov, A., Romanova, T.: Quasi-phi-functions and optimal packing of ellipses. J. Global Optim. 65(2), 283\u2013307 (2016)","journal-title":"J. Global Optim."},{"key":"21_CR24","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-18899-7_13","volume-title":"Optimized Packings and their Applications","author":"Yu Stoyan","year":"2015","unstructured":"Stoyan, Yu., Pankratov, A., Romanova, T., Chugay, A.: Optimized object packings using quasi-phi-functions. In: Fasano, G., Pinter, J.D. (eds.) Optimized Packings and their Applications. Springer Optimization and Its Applications, vol. 105, pp. 265\u2013291. Springer, Berlin (2015)"},{"key":"21_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1890-1","author":"A Pankratov","year":"2018","unstructured":"Pankratov, A., Romanova, T., Litvinchev, I.: Packing ellipses in an optimized rectangular container. Wirel. Netw. (2018). \n                  https:\/\/doi.org\/10.1007\/s11276-018-1890-1","journal-title":"Wirel. Netw."},{"issue":"10","key":"21_CR26","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1080\/00207160.2012.685468","volume":"89","author":"Y Stoyan","year":"2012","unstructured":"Stoyan, Y., Yaskov, G.: Packing equal circles into a circle with circular prohibited areas. Int. J. Comput. Math. 89(10), 355\u20131369 (2012)","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"21_CR27","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1057\/jors.2015.94","volume":"67","author":"Yu Stoyan","year":"2016","unstructured":"Stoyan, Yu., Pankratov, A., Romanova, T.: Cutting and packing problems for irregular objects with continuous rotations: mathematical modeling and nonlinear optimization. J. Oper. Res. Soc. 67(5), 786\u2013800 (2016)","journal-title":"J. Oper. Res. Soc."},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ejor.2018.01.025","volume":"268","author":"T Romanova","year":"2018","unstructured":"Romanova, T., Bennell, J., Stoyan, Y., Pankratov, A.: Packing of concave polyhedra with continuous rotations using nonlinear optimization. Eur. J. Oper. Res. 268, 37\u201353 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33585-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T12:07:14Z","timestamp":1572091634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33585-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,27]]},"ISBN":["9783030335847","9783030335854"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33585-4_21","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,27]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Koh Samui","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}