{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:23:11Z","timestamp":1761805391673,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Coordination for the Improvement of Higher Education Personal"},{"name":"National Counsel of Technological and Scientific Development","award":["308312\/2016- 3"],"award-info":[{"award-number":["308312\/2016- 3"]}]},{"name":"State of Goi\u00e1s Research Foundation"},{"DOI":"10.13039\/501100001807","name":"State of S\u00e3o Paulo Research Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10479-019-03466-x","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T14:03:09Z","timestamp":1574258589000},"page":"805-835","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts"],"prefix":"10.1007","volume":"316","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-4371","authenticated-orcid":false,"given":"Oliviana Xavier","family":"do Nascimento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2674-3366","authenticated-orcid":false,"given":"Thiago Alves","family":"de Queiroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-9118","authenticated-orcid":false,"given":"Leonardo","family":"Junqueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,20]]},"reference":[{"issue":"11","key":"3466_CR1","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1016\/j.cor.2010.01.017","volume":"37","author":"RR Amossen","year":"2010","unstructured":"Amossen, R. R., & Pisinger, D. (2010). Multi-dimensional bin packing problems with guillotine constraints. Computers & Operations Research, 37(11), 1999\u20132006.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3466_CR2","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.ejor.2005.11.060","volume":"183","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., & Boschetti, M. A. (2007). A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. European Journal of Operational Research, 183(3), 1136\u20131149.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"3466_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"3466_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10479-012-1084-7","volume":"196","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt, A., & Jungmann, S. (2012). A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Annals of Operations Research, 196(1), 53\u201371.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3466_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara, A., & Monaci, M. (2004). On the two-dimensional knapsack problem. Operations Research Letters, 32(1), 5\u201314.","journal-title":"Operations Research Letters"},{"issue":"1\u20132","key":"3466_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0360-8352(98)00084-9","volume":"35","author":"CF Chien","year":"1998","unstructured":"Chien, C. F., & Wu, W. T. (1998). A recursive computational procedure for container loading. Computers & Industrial Engineering, 35(1\u20132), 319\u2013322.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"3466_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"G Cintra","year":"2008","unstructured":"Cintra, G., Miyazawa, F., Wakabayashi, Y., & Xavier, E. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191(1), 61\u201385.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3466_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M Dolatabadi","year":"2012","unstructured":"Dolatabadi, M., Lodi, A., & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers & Operations Research, 39(1), 48\u201353.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3466_CR9","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","volume":"36","author":"J Egeblad","year":"2009","unstructured":"Egeblad, J., & Pisinger, D. (2009). Heuristic approaches for the two-and three-dimensional knapsack packing problem. Computers & Operations Research, 36(4), 1026\u20131049.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3466_CR10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","volume":"22","author":"T Fanslau","year":"2010","unstructured":"Fanslau, T., & Bortfeldt, A. (2010). A tree search algorithm for solving the container loading problem. INFORMS Journal on Computing, 22(2), 222\u2013235.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3466_CR11","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete, S. P., Schepers, J., & Van der Veen, J. C. (2007). An exact algorithm for higher-dimensional orthogonal packing. Operations Research, 55(3), 569\u2013587.","journal-title":"Operations Research"},{"issue":"4","key":"3466_CR12","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/ijoc.2016.0710","volume":"28","author":"F Furini","year":"2016","unstructured":"Furini, F., Malaguti, E., & Thomopulos, D. (2016). Modeling two-dimensional guillotine cutting problems via integer programming. INFORMS Journal on Computing, 28(4), 736\u2013751.","journal-title":"INFORMS Journal on Computing"},{"key":"3466_CR13","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"issue":"1","key":"3466_CR14","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P Gilmore","year":"1965","unstructured":"Gilmore, P., & Gomory, R. E. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research, 13(1), 94\u2013120.","journal-title":"Operations Research"},{"key":"3466_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.procs.2016.08.148","volume":"96","author":"Y Gonzalez","year":"2016","unstructured":"Gonzalez, Y., Miranda, G., & Leon, C. (2016). Multi-objective multi-level filling evolutionary algorithm for the 3d cutting stock problem. Procedia Computer Science, 96, 355\u2013364.","journal-title":"Procedia Computer Science"},{"issue":"6","key":"3466_CR16","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1111\/1475-3995.00386","volume":"9","author":"M Hifi","year":"2002","unstructured":"Hifi, M. (2002). Approximate algorithms for the container loading problem. International Transactions in Operational Research, 9(6), 747\u2013774.","journal-title":"International Transactions in Operational Research"},{"issue":"5","key":"3466_CR17","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/S0305-0548(03)00019-4","volume":"31","author":"M Hifi","year":"2004","unstructured":"Hifi, M. (2004). Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research, 31(5), 657\u2013674.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3466_CR18","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2010.07.017","volume":"39","author":"L Junqueira","year":"2012","unstructured":"Junqueira, L., Morabito, R., & Yamashita, D. S. (2012). Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 39(1), 74\u201385.","journal-title":"Computers & Operations Research"},{"key":"3466_CR19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.dam.2015.09.012","volume":"217","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Monaci, M., & Pietrobuoni, E. (2017). Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints. Discrete Applied Mathematics, 217, 40\u201347.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"3466_CR20","first-page":"59","volume":"1","author":"R Morabito","year":"1994","unstructured":"Morabito, R., & Arenales, M. (1994). An and\/or-graph approach to the container loading problem. International Transactions in Operational Research, 1(1), 59\u201373.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"3466_CR21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10479-008-0457-4","volume":"179","author":"R Morabito","year":"2010","unstructured":"Morabito, R., & Pureza, V. (2010). A heuristic approach based on dynamic programming and and\/or-graph search for the constrained two-dimensional guillotine cutting problem. Annals of Operations Research, 179(1), 297\u2013315.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3466_CR22","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & Sigurd, M. (2007). Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing, 19(1), 36\u201351.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3466_CR23","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J Puchinger","year":"2007","unstructured":"Puchinger, J., & Raidl, G. R. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304\u20131327.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3466_CR24","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2011.03.011","volume":"39","author":"TAd Queiroz","year":"2012","unstructured":"Queiroz, T Ad, Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3d guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2), 200\u2013212.","journal-title":"Computers & Operations Research"},{"key":"3466_CR25","volume-title":"Introduction to cutting and packing optimization: Problems, modeling approaches, solution methods","author":"G Scheithauer","year":"2017","unstructured":"Scheithauer, G. (2017). Introduction to cutting and packing optimization: Problems, modeling approaches, solution methods (Vol. 263). Berlin: Springer."},{"issue":"4","key":"3466_CR26","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1057\/jors.1996.57","volume":"47","author":"G Scheithauer","year":"1996","unstructured":"Scheithauer, G., & Terno, J. (1996). The g4-heuristic for the pallet loading problem. Journal of the Operational Research Society, 47(4), 511\u2013522.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"3466_CR27","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/s10479-015-1955-9","volume":"258","author":"A Toscano","year":"2017","unstructured":"Toscano, A., Rangel, S., & Yanasse, H. H. (2017). A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. Annals of Operations Research, 258(2), 719\u2013746.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3466_CR28","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2018.06.016","volume":"272","author":"AS Velasco","year":"2019","unstructured":"Velasco, A. S., & Uchoa, E. (2019). Improved state space relaxation for constrained two-dimensional guillotine cutting problems. European Journal of Operational Research, 272(1), 106\u2013120.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3466_CR29","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03466-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-019-03466-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03466-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T13:35:59Z","timestamp":1664976959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-019-03466-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3466"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03466-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,11,20]]},"assertion":[{"value":"20 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}