{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T22:29:18Z","timestamp":1770676158636,"version":"3.49.0"},"publisher-location":"Cham","reference-count":86,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"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-07124-4_43","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"931-977","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Cutting and Packing"],"prefix":"10.1007","author":[{"given":"Ram\u00f3n","family":"Alvarez-Valdes","sequence":"first","affiliation":[]},{"given":"Maria Ant\u00f3nia","family":"Carravilla","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans Syst Man Cybern 10(5):242\u2013248","DOI":"10.1109\/TSMC.1980.4308483"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Alonso M, Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2014) A reactive GRASP algorithm for the container loading problem with load-bearing constraints. Eur J Ind Eng 8:669\u2013694","DOI":"10.1504\/EJIE.2014.065732"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parajon A, Tamarit J (2002) A computational study of LP-based heuristic algorithms for the two-dimensional guillotine cutting stock problems. OR Spectr 24:179\u2013192","DOI":"10.1007\/s00291-002-0093-3"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parajon A, Tamarit J (2002) A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput Oper Res 29:925\u2013947","DOI":"10.1016\/S0305-0548(00)00095-2"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2005) A tabu search algorithm for the pallet loading problem. OR Spectr 27:43\u201361","DOI":"10.1007\/s00291-004-0183-5"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2007) A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur J Oper Res 183:1167\u20131182","DOI":"10.1016\/j.ejor.2005.11.068"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Marti R, Parajon A, Tamarit J (2007) GRASP and path relinking for the two-dimensional two-stage cutting-stock problem. INFORMS J Comput 19:261\u2013272","DOI":"10.1287\/ijoc.1050.0169"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2008) Reactive GRASP for the strip packing problem. Comput Oper Res 35:1065\u20131083","DOI":"10.1016\/j.cor.2006.07.004"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2013) A GRASP\/Path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Comput Oper Res 40: 3081\u20133090","DOI":"10.1016\/j.cor.2012.03.016"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Martinez A, Tamarit J (2013) A branch & bound algorithm for cutting and packing irregularly shaped pieces. Int J Prod Econ 145(2):463\u2013477","DOI":"10.1016\/j.ijpe.2013.04.007"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Araujo O, Armentano V (2007) A multi-start random constructive heuristic for the container loading problem. Pesquisa Operacional 27(2):311\u2013331","DOI":"10.1590\/S0101-74382007000200007"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Arenales M, Morabito R (1995) An AND\/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. Eur J Oper Res 84:599\u2013617","DOI":"10.1016\/0377-2217(95)00026-M"},{"key":"43_CR13","unstructured":"Art RC (1966) An approch to the two dimensional, irregular cutting stock problem. IBM Cambridge Scientific Center Report, pp 1\u201335"},{"issue":"4","key":"43_CR14","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B Baker","year":"1980","unstructured":"Baker B, Coffman E, Rivest R (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855","journal-title":"SIAM J Comput"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Below","year":"2008","unstructured":"Below G, Scheithauer G, Mukhacheva E (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59:823\u2013832","journal-title":"J Oper Res Soc"},{"issue":"8","key":"43_CR16","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1287\/mnsc.47.8.1160.10230","volume":"47","author":"JA Bennell","year":"2001","unstructured":"Bennell JA, Dowsland KA (2001) Hybridising tabu search with optimisation techniques for irregular stock cutting. Manag Sci 47(8):1160\u20131172","journal-title":"Manag Sci"},{"issue":"2","key":"43_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell JA, Oliveira JF (2008) The geometry of nesting problems: a tutorial. Eur J Oper Res 184(2):397\u2013415","journal-title":"Eur J Oper Res"},{"issue":"2","key":"43_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"JA Bennell","year":"2010","unstructured":"Bennell JA, Song X (2010) A beam search implementation for the irregular shape packing problem. J Heuristics 16(2):167\u2013188","journal-title":"J Heuristics"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"J Bennell","year":"2013","unstructured":"Bennell J, Lee L, Potts C (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145:547\u2013560","journal-title":"Int J Prod Econ"},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt A, Gehring H (2001) A hybrid algorithm for the container loading problem. Eur J Oper Res 131:143\u2013161","journal-title":"Eur J Oper Res"},{"issue":"4","key":"43_CR21","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E Burke","year":"2004","unstructured":"Burke E, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671","journal-title":"Oper Res"},{"issue":"3","key":"43_CR22","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"E Burke","year":"2009","unstructured":"Burke E, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J Comput 21(3):505\u2013516","journal-title":"INFORMS J Comput"},{"key":"43_CR23","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1016\/j.cor.2010.10.005","volume":"38","author":"E Burke","year":"2011","unstructured":"Burke E, Hyde M, Kendall G (2011) A squeaky wheel optimization methodology for two-dimensional strip packing. Comput Oper Res 38:1035\u20131044","journal-title":"Comput Oper Res"},{"key":"43_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10732-011-9162-6","volume":"19","author":"S Ceschia","year":"2013","unstructured":"Ceschia S, Schaerf A (2013) Local search for a multi-drop multi-container loading problem. J Heuristics 19:275\u2013294","journal-title":"J Heuristics"},{"issue":"8","key":"43_CR25","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32","author":"B Chazelle","year":"1983","unstructured":"Chazelle B (1983) The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 32(8):697\u2013707","journal-title":"IEEE Trans Comput"},{"key":"43_CR26","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1057\/jors.2013.54","volume":"65","author":"W Chen","year":"2014","unstructured":"Chen W, Zhai P, Zhu H, Zhang Y (2014) Hybrid algorithm for the two-dimensional rectangular layer-packing problem. J Oper Res Soc 65:1068\u20131077","journal-title":"J Oper Res Soc"},{"issue":"3","key":"43_CR27","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1590\/0101-7438.2016.036.03.0447","volume":"36","author":"L Cherri","year":"2016","unstructured":"Cherri L, Toledo F, Carravilla MA (2016) A model-based heuristic for the irregular strip packing problem. Pesquisa Operacional 36(3):447\u2013468","journal-title":"Pesquisa Operacional"},{"key":"43_CR28","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1111\/j.1475-3995.2009.00714.x","volume":"16","author":"S Christensen","year":"2009","unstructured":"Christensen S, Rousoe D (2009) Container loading with multi-drop constraints. Int Trans Oper Res 16:727\u2013743","journal-title":"Int Trans Oper Res"},{"key":"43_CR29","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.cor.2012.11.003","volume":"40","author":"J Silveira da","year":"2013","unstructured":"da Silveira J, Miyazawa F, Xavier E (2013) Heuristics for the strip packing problem with unloading constraints. Comput Oper Res 40:991\u20131003","journal-title":"Comput Oper Res"},{"key":"43_CR30","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","volume":"49","author":"KA Dowsland","year":"1998","unstructured":"Dowsland KA, Dowsland WB, Bennell JA (1998) Jostling for position: local improvement for irregular cutting patterns. J Oper Res Soc 49:647\u2013658","journal-title":"J Oper Res Soc"},{"issue":"2","key":"43_CR31","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0377-2217(02)00131-5","volume":"141","author":"KA Dowsland","year":"2002","unstructured":"Dowsland KA, Vaid S, Dowsland WB (2002) An algorithm for polygon placement using a bottom-left strategy. Eur J Oper Res 141(2):371\u2013381","journal-title":"Eur J Oper Res"},{"key":"43_CR32","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","volume":"29","author":"H Dyckhoff","year":"1981","unstructured":"Dyckhoff H (1981) A new linear programming approach to the cutting stock problem. Oper Res 29:1092\u20131104","journal-title":"Oper Res"},{"issue":"3","key":"43_CR33","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.ejor.2005.11.063","volume":"183","author":"J Egeblad","year":"2007","unstructured":"Egeblad J, Nielsen BK, Odgaard A (2007) Fast neighborhood search for two- and three-dimensional nesting problems. Eur J Oper Res 183(3):1249\u20131266","journal-title":"Eur J Oper Res"},{"key":"43_CR34","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","volume":"141","author":"M Eley","year":"2002","unstructured":"Eley M (2002) Solving container loading problems by block arrangement. Eur J Oper Res 141:393\u2013409","journal-title":"Eur J Oper Res"},{"issue":"3","key":"43_CR35","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ejor.2013.06.020","volume":"231","author":"A Elkeran","year":"2013","unstructured":"Elkeran A (2013) A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur J Oper Res 231(3):757\u2013769","journal-title":"Eur J Oper Res"},{"issue":"2","key":"43_CR36","doi-asserted-by":"publisher","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 J Comput 22(2):222\u2013235","journal-title":"INFORMS J Comput"},{"issue":"3","key":"43_CR37","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","volume":"15","author":"O Faroe","year":"2003","unstructured":"Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J Comput 15(3):267\u2013283","journal-title":"INFORMS J Comput"},{"issue":"3","key":"43_CR38","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-008-9088-9","volume":"15","author":"M Fischetti","year":"2009","unstructured":"Fischetti M, Luzzi I (2009) Mixed-integer programming models for nesting problems. J Heuristics 15(3):201\u2013226","journal-title":"J Heuristics"},{"key":"43_CR39","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore P, Gomory R (1961) A linear programming approach to the cutting-stock problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"43_CR40","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P Gilmore","year":"1963","unstructured":"Gilmore P, Gomory R (1963) A linear programming approach to the cutting-stock problem \u2013 part II. Oper Res 11:863\u2013888","journal-title":"Oper Res"},{"key":"43_CR41","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P Gilmore","year":"1965","unstructured":"Gilmore P, Gomory R (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13:94\u2013120","journal-title":"Oper Res"},{"issue":"2","key":"43_CR42","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"AM Gomes","year":"2002","unstructured":"Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems. Eur J Oper Res 141(2):359\u2013370","journal-title":"Eur J Oper Res"},{"issue":"3","key":"43_CR43","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2004.09.008","volume":"171","author":"AM Gomes","year":"2006","unstructured":"Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res 171(3):811\u2013829","journal-title":"Eur J Oper Res"},{"key":"43_CR44","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"J Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves J, Resende M (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145:500\u2013510","journal-title":"Int J Prod Econ"},{"issue":"150624","key":"43_CR45","first-page":"1","volume":"2009","author":"M Hifi","year":"2009","unstructured":"Hifi M, M\u2019Hallah R (2009) A literature review on circle and sphere packing problems: models and methodologies. Adv Oper Res 2009(150624):1\u201322","journal-title":"Adv Oper Res"},{"key":"43_CR46","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M Hifi","year":"2004","unstructured":"Hifi M, Michrafy M, Sbihi A (2004) Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J Oper Res Soc 55:1323\u20131332","journal-title":"J Oper Res Soc"},{"key":"43_CR47","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper E, Turton B (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128:34\u201357","journal-title":"Eur J Oper Res"},{"issue":"4","key":"43_CR48","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disopt.2009.04.002","volume":"6","author":"T Imamichi","year":"2009","unstructured":"Imamichi T, Yagiura M, Nagamochi H (2009) An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discret Optim 6(4): 345\u2013361","journal-title":"Discret Optim"},{"key":"43_CR49","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-1-4613-0233-9_7","volume-title":"Optimization in industry: new frontiers","author":"M Iori","year":"2003","unstructured":"Iori M, Martello S, Monaci M (2003) Metaheuristic algorithms for the strip packing problem. In: Pardalos PM, Korotkikh V (eds) Optimization in industry: new frontiers. Kluwer Academic Publishers, Dordrecht, pp 159\u2013179"},{"key":"43_CR50","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs S (1996) On genetic algorithms for the packing of polygons. Eur J Oper Res 88: 165\u2013181","journal-title":"Eur J Oper Res"},{"key":"43_CR51","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","volume":"32","author":"K Lai","year":"1997","unstructured":"Lai K, Chan J (1997) Developing a simulated annealing algorithm for the cutting stock problem. Comput Ind Eng 32:115\u2013127","journal-title":"Comput Ind Eng"},{"issue":"4","key":"43_CR52","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2005.08.013","volume":"97","author":"N Lesh","year":"2006","unstructured":"Lesh N, Mitzenmacher M (2006) Bubblesearch: a simple heuristic for improving priority-based greedy algorithms. Inf Process Lett 97(4):161\u2013169","journal-title":"Inf Process Lett"},{"key":"43_CR53","unstructured":"Lesh N, Marks J, McMahon A, Mitzenmacher M (2003) New heuristic and interactive approaches to 2D rectangular strip packing. Technical report TR2003-18. Mitsubishi Electric Research Laboratories, Cambridge"},{"key":"43_CR54","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(02)00218-7","volume":"145","author":"T Leung","year":"2003","unstructured":"Leung T, Chan C, Troutt M (2003) Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur J Oper Res 145:530\u2013542","journal-title":"Eur J Oper Res"},{"key":"43_CR55","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"S Leung","year":"2011","unstructured":"Leung S, Zhang D, Sim K (2011) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Eur J Oper Res 215:57\u201369","journal-title":"Eur J Oper Res"},{"key":"43_CR56","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2010.10.022","volume":"39","author":"S Leung","year":"2012","unstructured":"Leung S, Zhang D, Zhou C, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39:64\u201373","journal-title":"Comput Oper Res"},{"issue":"3","key":"43_CR57","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.cor.2011.05.025","volume":"39","author":"SC Leung","year":"2012","unstructured":"Leung SC, Lin Y, Zhang D (2012) Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. Comput Oper Res 39(3):678\u2013686","journal-title":"Comput Oper Res"},{"key":"43_CR58","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D Liu","year":"1999","unstructured":"Liu D, Teng H (1999) An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur J Oper Res 112:413\u2013420","journal-title":"Eur J Oper Res"},{"key":"43_CR59","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2007.06.032","volume":"190","author":"D Liu","year":"2008","unstructured":"Liu D, Tan K, Huang S, Goh C, Ho W (2008) On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur J Oper Res 190:357\u2013382","journal-title":"Eur J Oper Res"},{"key":"43_CR60","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/B:ANOR.0000039519.03572.08","volume":"131","author":"A Lodi","year":"2004","unstructured":"Lodi A, Martello S, Vigo D (2004) TSpack: a unified tabu search code for multi-dimensional bin packing problems. Ann Oper Res 131:203\u2013213","journal-title":"Ann Oper Res"},{"key":"43_CR61","unstructured":"Martinez Sykora A (2013) Nesting problems: exact and heuristic algorithms. Phd thesis, Univesity of Valencia"},{"key":"43_CR62","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.omega.2014.10.007","volume":"52","author":"A Martinez-Sykora","year":"2015","unstructured":"Martinez-Sykora A, Alvarez-Valdes R, Bennell J, Tamarit JM (2015) Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts. Omega 52:15\u201332","journal-title":"Omega"},{"key":"43_CR63","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1111\/j.1475-3995.1999.tb00171.x","volume":"6","author":"VJ Milenkovic","year":"1999","unstructured":"Milenkovic VJ, Daniels K (1999) Translational polygon containment and minimal enclosure using mathematical programming. Int Trans Oper Res 6:525\u2013554","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"43_CR64","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00291-008-0129-4","volume":"31","author":"A Moura","year":"2008","unstructured":"Moura A, Oliveira JF (2008) An integrated approach to the vehicle routing and container loading problems. OR Spect 31(4):775\u2013800","journal-title":"OR Spect"},{"key":"43_CR65","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1590\/S0101-74382000000200002","volume":"20","author":"E Mukhacheva","year":"2000","unstructured":"Mukhacheva E, Belov G, Kartak V, Mukhacheva A (2000) Linear one-dimensional cutting-packing problems: numerical experiments with sequential value correction method (SVC) and a modified branch-and-bound method (MBB). Pesquisa Operacional 20:153\u2013168","journal-title":"Pesquisa Operacional"},{"key":"43_CR66","first-page":"256","volume-title":"Applied simulated annealing","author":"JF Oliveira","year":"1993","unstructured":"Oliveira JF, Ferreira JS (1993) Algorithms for nesting problems. In: Vidal RVV (ed) Applied simulated annealing. Lecture notes in economics and mathematical systems. Springer, Berlin, pp 256\u2013279"},{"issue":"2","key":"43_CR67","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s002910050105","volume":"22","author":"JF Oliveira","year":"2000","unstructured":"Oliveira JF, Gomes AM, Ferreira JS (2000) TOPOS \u2013 a new constructive algorithm for nesting problems. OR Spektr 22(2):263\u2013284","journal-title":"OR Spektr"},{"issue":"1","key":"43_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","volume":"16","author":"F Parre\u00f1o","year":"2010","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Oliveira J, Tamarit J (2010) Neighbourhood structures for the container loading problem: a VNS implementation. J Heuristics 16(1):1\u201322","journal-title":"J Heuristics"},{"key":"43_CR69","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141:382\u2013392","journal-title":"Eur J Oper Res"},{"key":"43_CR70","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1016\/j.cor.2004.08.009","volume":"33","author":"V Pureza","year":"2006","unstructured":"Pureza V, Morabito R (2006) Some experiments with a simple tabu search algorithm for the manufacturers pallet loading problem. Comput Oper Res 33:804\u2013819","journal-title":"Comput Oper Res"},{"key":"43_CR71","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.ejor.2011.04.025","volume":"214","author":"J Ren","year":"2011","unstructured":"Ren J, Tian Y, Sawaragi T (2011) A tree search method for the container loading problem with shipment priority. Eur J Oper Res 214:526\u2013535","journal-title":"Eur J Oper Res"},{"key":"43_CR72","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/0377-2217(95)00200-6","volume":"91","author":"J Riehme","year":"1996","unstructured":"Riehme J, Scheithauer G, Terno J (1996) The solution of two-stage guillotine cutting stock problems having extremely varying order demands. Eur J Oper Res 91:543\u2013552","journal-title":"Eur J Oper Res"},{"issue":"8","key":"43_CR73","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.cad.2012.03.004","volume":"44","author":"AK Sato","year":"2012","unstructured":"Sato AK, Martins TC, Tsuzuki MSG (2012) An algorithm for the strip packing problem using collision free region and exact fitting placement. Comput Aided Des 44(8):766\u2013777","journal-title":"Comput Aided Des"},{"issue":"3","key":"43_CR74","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0097-8493(86)90007-5","volume":"10","author":"SA Segenreich","year":"1986","unstructured":"Segenreich SA, Braga LMPF (1986) Optimal nesting of general plane figures: a Monte Carlo heuristical approach. Comput Graph 10(3):229\u2013237","journal-title":"Comput Graph"},{"issue":"7","key":"43_CR75","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1057\/jors.2013.44","volume":"65","author":"X Song","year":"2013","unstructured":"Song X, Bennell Ja (2013) Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem. J Oper Res Soc 65(7):1037\u20131052","journal-title":"J Oper Res Soc"},{"key":"43_CR76","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0377-2217(90)90356-G","volume":"44","author":"H Stadtler","year":"1990","unstructured":"Stadtler H (1990) A one-dimensional cutting stock problem in the aluminium industry and its solution. Eur J Oper Res 44:209\u2013223","journal-title":"Eur J Oper Res"},{"issue":"1","key":"43_CR77","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0377-2217(95)00038-0","volume":"92","author":"YG Stoyan","year":"1996","unstructured":"Stoyan YG, Novozhilova MV, Kartashov AV (1996) Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. Eur J Oper Res 92(1):193\u2013210","journal-title":"Eur J Oper Res"},{"key":"43_CR78","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s00500-002-0203-9","volume":"7","author":"S Takahara","year":"2003","unstructured":"Takahara S, Kusumoto Y, Miyamoto S (2003) Solution for textile nesting problems using adaptive meta-heuristics and grouping. Soft Comput 7:154\u2013159","journal-title":"Soft Comput"},{"key":"43_CR79","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","volume":"145","author":"FMB Toledo","year":"2013","unstructured":"Toledo FMB, Carravilla MA, Ribeiro C, Oliveira JF, Gomes AM (2013) The dotted-board model: a new MIP model for nesting irregular shapes. Int J Prod Econ 145:478\u2013487","journal-title":"Int J Prod Econ"},{"issue":"6","key":"43_CR80","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1111\/j.1475-3995.2009.00707.x","volume":"16","author":"S Umetani","year":"2009","unstructured":"Umetani S, Yagiura M, Imahori S, Imamichi T, Nonobe K, Ibaraki T (2009) Solving the irregular strip packing problem via guided local search for overlap minimization. Int Trans Oper Res 16(6):661\u2013683","journal-title":"Int Trans Oper Res"},{"key":"43_CR81","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J Valerio de Carvalho","year":"2002","unstructured":"Valerio de Carvalho J (2002) LP models for bin packing and cutting stock problems. Eur J Oper Res 141:253\u2013273","journal-title":"Eur J Oper Res"},{"key":"43_CR82","doi-asserted-by":"crossref","unstructured":"W\u00e4scher G, Hau\u00df ner 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"},{"key":"43_CR83","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2014.10.004","volume":"242","author":"L Wei","year":"2015","unstructured":"Wei L, Lim A (2015) A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. Eur J Oper Res 242:63\u201371","journal-title":"Eur J Oper Res"},{"key":"43_CR84","first-page":"337","volume":"215","author":"L Wei","year":"2011","unstructured":"Wei L, Oon W, Zhu W, Lim A (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur J Oper Res 215:337\u2013346","journal-title":"Eur J Oper Res"},{"key":"43_CR85","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y Wu","year":"2002","unstructured":"Wu Y, Huang W, Lau S, Wong C, Young G (2002) An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res 141:341\u2013358","journal-title":"Eur J Oper Res"},{"key":"43_CR86","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10489-012-0337-0","volume":"37","author":"W Zhu","year":"2012","unstructured":"Zhu W, Oon W, Lim A, Weng Y (2012) The six elements to block-building approaches for the single container loading problem. Appl Intell 37:431\u2013445","journal-title":"Appl Intell"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:22:11Z","timestamp":1571728931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":86,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_43","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}