{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T18:03:12Z","timestamp":1761156192015,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T00:00:00Z","timestamp":1477353600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71371058","61363026"],"award-info":[{"award-number":["71371058","61363026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10878-016-0088-7","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T12:54:16Z","timestamp":1477400056000},"page":"588-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Triple-solution approach for the strip packing problem with two-staged patterns"],"prefix":"10.1007","volume":"34","author":[{"given":"Yi-Ping","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongwu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaodong","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,25]]},"reference":[{"key":"88_CR1","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35:1065\u20131083","journal-title":"Comput Oper Res"},{"key":"88_CR2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-008-0128-5","volume":"31","author":"R Alvarez-Valdes","year":"2009","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectr 31:431\u2013459","journal-title":"OR Spectr"},{"issue":"4","key":"88_CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10288-007-0051-7","volume":"6","author":"A Bettinelli","year":"2008","unstructured":"Bettinelli A, Ceselli A, Righini G (2008) A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR-Q J Oper Res 6(4):361\u2013374","journal-title":"4OR-Q J Oper Res"},{"key":"88_CR4","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172:814\u2013837","journal-title":"Eur J Oper Res"},{"key":"88_CR5","doi-asserted-by":"crossref","unstructured":"Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191:61\u201385","DOI":"10.1016\/j.ejor.2007.08.007"},{"key":"88_CR6","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman","year":"1980","unstructured":"Coffman EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J Comput 9:808\u2013826","journal-title":"SIAM J Comput"},{"key":"88_CR7","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(90)90349-G","volume":"44","author":"EG Coffman","year":"1990","unstructured":"Coffman EG, Shor PW (1990) Average-case analysis of cutting and packing in two dimensions. Eur J Oper Res 44:134\u2013144","journal-title":"Eur J Oper Res"},{"key":"88_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/opre.2013.1248","volume":"62","author":"J-F C\u00f4t\u00e9","year":"2014","unstructured":"C\u00f4t\u00e9 J-F, Dell\u2019Amico M, Iori M (2014) Combinatorial benders\u2019 cuts for the strip packing problem. Oper Res 62:643\u2013661","journal-title":"Oper Res"},{"key":"88_CR9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.ejor.2013.05.042","volume":"231","author":"Y Cui","year":"2013","unstructured":"Cui Y, Zhao Z (2013) Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns. Eur J Oper Res 231:288\u2013298","journal-title":"Eur J Oper Res"},{"key":"88_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ejor.2014.06.032","volume":"240","author":"Y-P Cui","year":"2015","unstructured":"Cui Y-P, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240:43\u201353","journal-title":"Eur J Oper Res"},{"key":"88_CR11","doi-asserted-by":"crossref","first-page":"5542","DOI":"10.1016\/j.eswa.2013.04.005","volume":"40","author":"K He","year":"2013","unstructured":"He K, Jin Y, Huang W (2013) Heuristics for two-dimensional strip packing problem with 90 degrees rotations. Expert Syst Appl 40:5542\u20135550","journal-title":"Expert Syst Appl"},{"key":"88_CR12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999) Heuristics and meta-heuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11:345\u2013357","journal-title":"INFORMS J Comput"},{"key":"88_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A Lodi","year":"2004","unstructured":"Lodi A, Martello S, Vigo D (2004) Models and bounds for two-dimensional level packing problems. J Comb Optim 8:363\u2013379","journal-title":"J Comb Optim"},{"key":"88_CR14","doi-asserted-by":"crossref","first-page":"1850","DOI":"10.1057\/jors.2015.8","volume":"66","author":"M Mrad","year":"2015","unstructured":"Mrad M (2015) An arc flow-based optimization approach for the two-stage guillotine strip packing problem. J Oper Res Soc 66:1850\u20131859","journal-title":"J Oper Res Soc"},{"key":"88_CR15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.disopt.2008.11.002","volume":"6","author":"N Ntene","year":"2009","unstructured":"Ntene N, van Vuuren JH (2009) A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discret Optim 6:174\u2013188","journal-title":"Discret Optim"},{"key":"88_CR16","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2010.01.039","volume":"205","author":"E Silva","year":"2010","unstructured":"Silva E, Alvelos F, Val\u00e9rio de Carvalho JM (2010) An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur J Oper Res 205:699\u2013708","journal-title":"Eur J Oper Res"},{"key":"88_CR17","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.ejor.2012.08.005","volume":"224","author":"L Wei","year":"2013","unstructured":"Wei L, Oon W-C, Zhu W, Lim A (2013) A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. Eur J Oper Res 224:110\u2013121","journal-title":"Eur J Oper Res"},{"key":"88_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1111\/itor.12138","volume":"23","author":"L Wei","year":"2016","unstructured":"Wei L, Qin Hu, Cheang B, Xu X (2016) An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. Int Trans Oper Res 23:65\u201392","journal-title":"Int Trans Oper Res"},{"key":"88_CR19","doi-asserted-by":"crossref","unstructured":"W\u00e4scher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130","DOI":"10.1016\/j.ejor.2005.12.047"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0088-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0088-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0088-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T03:12:02Z","timestamp":1500261122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0088-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,25]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["88"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0088-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,10,25]]}}}