{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:37Z","timestamp":1759847317048},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319715827"},{"type":"electronic","value":"9783319715834"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-71583-4_11","type":"book-chapter","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T17:03:45Z","timestamp":1518627825000},"page":"151-164","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Two-Dimensional Strip Packing Problem: What Matters?"],"prefix":"10.1007","author":[{"given":"Alvaro","family":"Neuenfeldt J\u00fanior","sequence":"first","affiliation":[]},{"given":"Elsa","family":"Silva","sequence":"additional","affiliation":[]},{"given":"A.","family":"Miguel Gomes","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"J.E. Beasley, An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1), 49\u201364 (1985)","journal-title":"Oper. Res."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"J.E. Beasley, Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 297\u2013306 (1985)","DOI":"10.1057\/jors.1985.51"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"B.E. Bengtsson, Packing rectangular pieces - a heuristic approach. Comput. J. 25(3), 353\u2013357 (1982)","DOI":"10.1093\/comjnl\/25.3.353"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"J.O. Berkey, P.Y. Wang, Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 423\u2013429 (1987)","DOI":"10.1057\/jors.1987.70"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. Bortfeldt, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. 172(3), 814\u2013837 (2006)","DOI":"10.1016\/j.ejor.2004.11.016"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"A. Bortfeldt, H. Gehring, A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1), 143\u2013161 (2001)","DOI":"10.1016\/S0377-2217(00)00055-2"},{"issue":"4","key":"11_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"E.K. Burke, G. Kendall, G. Whitwell, A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52(4), 655\u2013671 (2004)","journal-title":"Oper. Res."},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"N. Christofides, C. Whitlock, An algorithm for two-dimensional cutting problems. Oper. Res. 25(1), 30\u201344 (1977)","journal-title":"Oper. Res."},{"key":"11_CR9","unstructured":"E.P. Ferreira, J.F. Oliveira, A note on Fekete and Schepers\u2019 algorithm for the non-guillotinable two-dimensional packing problem (Technical report, FEUP, 2005)"},{"issue":"6","key":"11_CR10","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"NG Hall","year":"2001","unstructured":"N.G. Hall, M.E. Posner, Generating experimental data for computational testing with machine scheduling applications. Oper. Res. 49(6), 854\u2013865 (2001)","journal-title":"Oper. Res."},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"E. Hopper, B.C.H. Turton, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128, 34\u201357 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR12","unstructured":"E. Hopper, Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. PhD thesis, University of Wales, Cardiff, 2000"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"S. Imahori, M. Yagiura, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37(2), 325\u2013333 (2010)","DOI":"10.1016\/j.cor.2009.05.008"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"S.C.H. Leung, D. Zhang, A fast layer-based heuristic for non-guillotine strip packing. Expert Syst. Appl. 38(10), 13032\u201313042 (2011)","DOI":"10.1016\/j.eswa.2011.04.105"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S.C.H Leung, D. Zhang, K.M. Sim, A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215(1):57\u201369 (2011)","DOI":"10.1016\/j.ejor.2011.06.002"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"E. L\u00f3pez-Camacho, H. Terashima-Mar\u00edn, G. Ochoa, S.E. Conant-Pablos, Understanding the structure of bin packing problems through principal component analysis. Int. J. Prod. Econ. 145(2), 488\u2013499 (2013)","DOI":"10.1016\/j.ijpe.2013.04.041"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"E. L\u00f3pez\u2013Camacho, H. Terashima\u2013Marin, P. Ross, G. Ochoa, A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl. 41(15), 6876\u20136889 (2014)","DOI":"10.1016\/j.eswa.2014.04.043"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"S. Martello, D. Vigo, Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44(3), 388\u2013399 (1998)","DOI":"10.1287\/mnsc.44.3.388"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"J.F. Oliveira, A.N. J\u00fanior, E. Silva, M.A. Carravilla, A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesqui. Oper. 36(2):197\u2013226 (2016)","DOI":"10.1590\/0101-7438.2016.036.02.0197"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"E. Silva, J.F. Oliveira, G. W\u00e4scher, 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems. Eur. J. Oper. Res. 237(3), 846\u2013856 (2014)","DOI":"10.1016\/j.ejor.2014.02.059"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"K. Smith\u2013Miles, L. Lopes, Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","DOI":"10.1016\/j.cor.2011.07.006"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"P.Y. Wang, C.L. Valenzela, Data set generation for rectangular placement problems. Eur. J. Oper. Res. 134(2), 378\u2013391 (2001)","DOI":"10.1016\/S0377-2217(00)00263-0"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"G. W\u00e4scher, H. Hau\u00dfner, H. Schumann, An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","DOI":"10.1016\/j.ejor.2005.12.047"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71583-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T17:11:59Z","timestamp":1518628319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71583-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319715827","9783319715834"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71583-4_11","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2018]]}}}