{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:48Z","timestamp":1767339828951},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,26]],"date-time":"2014-10-26T00:00:00Z","timestamp":1414281600000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10288-014-0274-3","type":"journal-article","created":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T10:20:59Z","timestamp":1414232459000},"page":"199-219","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the $$L$$ L -approach for generating unconstrained two-dimensional non-guillotine cutting patterns"],"prefix":"10.1007","volume":"13","author":[{"given":"Thiago Alves","family":"de Queiroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fl\u00e1vio Keidi","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiko","family":"Wakabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,26]]},"reference":[{"issue":"11","key":"274_CR1","doi-asserted-by":"crossref","first-page":"3007","DOI":"10.1016\/j.cor.2004.04.010","volume":"32","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2005) A branch-and-cut algorithm for the pallet loading problem. Comput Oper Res 32(11):3007\u20133029","journal-title":"Comput Oper Res"},{"key":"274_CR2","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.ejor.2005.11.060","volume":"183","author":"RB Baldacci","year":"2007","unstructured":"Baldacci RB, Boschetti MA (2007) A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur J Oper Res 183:1136\u20131149","journal-title":"Eur J Oper Res"},{"issue":"1","key":"274_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33(1):49\u201364","journal-title":"Oper Res"},{"issue":"11","key":"274_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"2","key":"274_CR5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1057\/jors.2008.141","volume":"61","author":"EG Birgin","year":"2010","unstructured":"Birgin EG, Lobato RD, Morabito R (2010) An effective recursive partitioning approach for the packing of identical rectangles in a rectangle. J Oper Res Soc 61(2):306\u2013320","journal-title":"J Oper Res Soc"},{"issue":"2","key":"274_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2011.6","volume":"63","author":"EG Birgin","year":"2012","unstructured":"Birgin EG, Lobato RD, Morabito R (2012) Generating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithm. J Oper Res Soc 63(2):183\u2013200","journal-title":"J Oper Res Soc"},{"key":"274_CR7","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. Oper Res Lett 32:5\u201314","journal-title":"Oper Res Lett"},{"issue":"3","key":"274_CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.disopt.2010.03.003","volume":"7","author":"A Caprara","year":"2010","unstructured":"Caprara A, Lodi A, Monaci M (2010) An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret Optim 7(3):114\u2013124","journal-title":"Discret Optim"},{"key":"274_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"GF Cintra","year":"2008","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:59\u201383","journal-title":"Eur J Oper Res"},{"issue":"16","key":"274_CR10","doi-asserted-by":"crossref","first-page":"12589","DOI":"10.1016\/j.eswa.2012.05.025","volume":"39","author":"AM Valle Del","year":"2012","unstructured":"Del Valle AM, Queiroz TA, Miyazawa FK, Xavier EC (2012) Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape. Expert Syst Appl 39(16):12589\u201312598","journal-title":"Expert Syst Appl"},{"key":"274_CR11","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. Comput Oper Res 39:48\u201353","journal-title":"Comput Oper Res"},{"key":"274_CR12","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0377-2217(93)E0221-I","volume":"84","author":"D Fayard","year":"1995","unstructured":"Fayard D, Zissimopoulos V (1995) An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Eur J Oper Res 84:618\u2013632","journal-title":"Eur J Oper Res"},{"issue":"3","key":"274_CR13","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete SP, Schepers J, van der Veen J (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55(3):569\u2013587","journal-title":"Oper Res"},{"key":"274_CR14","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"5","key":"274_CR15","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1147\/rd.165.0462","volume":"16","author":"JC Herz","year":"1972","unstructured":"Herz JC (1972) A recursive computational procedure for two-dimensional stock-cutting. IBM J Res Dev 16(5):462\u2013469","journal-title":"IBM J Res Dev"},{"issue":"16","key":"274_CR16","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ipl.2010.05.031","volume":"110","author":"A Kulik","year":"2010","unstructured":"Kulik A, Shachnai H (2010) There is no EPTAS for two-dimensional knapsack. Inf Process Lett 110(16):707\u2013710","journal-title":"Inf Process Lett"},{"key":"274_CR17","doi-asserted-by":"crossref","unstructured":"Lins L, Lins S, Morabito R (2003) An L-approach for packing $$(l, w)$$ ( l , w ) -rectangles into rectangular and L-shaped pieces. J Oper Res Soc 54:777\u2013789","DOI":"10.1057\/palgrave.jors.2601553"},{"issue":"3","key":"274_CR18","doi-asserted-by":"crossref","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 manufacturer\u2019s pallet loading problem. Comput Oper Res 33(3):804\u2013819","journal-title":"Comput Oper Res"},{"key":"274_CR19","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2011.03.011","volume":"39","author":"TA Queiroz","year":"2012","unstructured":"Queiroz TA, Miyazawa F, Wakabayashi Y, Xavier E (2012) Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Comput Oper Res 39:200\u2013212","journal-title":"Comput Oper Res"},{"issue":"2","key":"274_CR20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.ijpe.2013.04.031","volume":"145","author":"M Russo","year":"2013","unstructured":"Russo M, Sforzab A, Sterle C (2013) An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem. Int J Prod Econ 145(2):451\u2013462","journal-title":"Int J Prod Econ"},{"key":"274_CR21","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. J Oper Res Soc 47:511\u2013522","journal-title":"J Oper Res Soc"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0274-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-014-0274-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0274-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:59Z","timestamp":1559131979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-014-0274-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,26]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["274"],"URL":"https:\/\/doi.org\/10.1007\/s10288-014-0274-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,26]]}}}