{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:46:02Z","timestamp":1756809962124},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00291-013-0347-2","type":"journal-article","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T12:46:39Z","timestamp":1380545199000},"page":"49-74","source":"Crossref","is-referenced-by-count":8,"title":["Lower bounds for three-dimensional multiple-bin-size bin packing problems"],"prefix":"10.1007","volume":"37","author":[{"given":"R.","family":"Alvarez-Valdes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Parre\u00f1o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"Tamarit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,1]]},"reference":[{"key":"347_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2012) A GRASP\/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Comput Oper Res. doi: 10.1016\/j.cor.2012.03.016","DOI":"10.1016\/j.cor.2012.03.016"},{"key":"347_CR2","doi-asserted-by":"crossref","unstructured":"Alves C, Valerio de Carvalho JM (2008) A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput Oper Res 35:1315\u20131328","DOI":"10.1016\/j.cor.2006.08.014"},{"key":"347_CR3","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:1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"347_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38:423\u2013429","journal-title":"J Oper Res Soc"},{"key":"347_CR5","unstructured":"Boschetti M, Mingozzi A (2003) Two-dimensional finite bin packing problems. Part I: New lower and upper bounds, 4OR 1:27\u201342"},{"issue":"3","key":"347_CR6","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.1030.0068","volume":"17","author":"L Brunetta","year":"2005","unstructured":"Brunetta L, Gregoire P (2005) A general purpose algorithm for three-dimensional packing. INFORMS J Comput 17(3):328\u2013338","journal-title":"INFORMS J Comput"},{"issue":"8","key":"347_CR7","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"34","author":"J Carlier","year":"2007","unstructured":"Carlier J, Clautiaux F, Moukrim A (2007) New reduction procedures and lower bounds for the two dimensional bin packing problem with fixed orientation. Comput Oper Res 34(8):2223\u20132250","journal-title":"Comput Oper Res"},{"issue":"1","key":"347_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","volume":"80","author":"CS Chen","year":"1995","unstructured":"Chen CS, Lee SM, Shen QS (1995) Analytical model for the container loading problem. Eur J Oper Res 80(1):68\u201376","journal-title":"Eur J Oper Res"},{"key":"347_CR9","doi-asserted-by":"crossref","first-page":"61","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:61\u201385","journal-title":"Eur J Oper Res"},{"issue":"6","key":"347_CR10","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1016\/j.cor.2006.10.014","volume":"35","author":"I Correia","year":"2008","unstructured":"Correia I, Gouveia L, Saldanha-da-Gama F (2008) Solving the variable size bin packing problem with discretized formulations. Comput Oper Res 35(6):2103\u20132113","journal-title":"Comput Oper Res"},{"key":"347_CR11","doi-asserted-by":"crossref","unstructured":"Crainic TG, Perboli G, Rei W, Tadei R (2011) Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput Oper Res. doi: 10.1016\/j.cor.2011.01.001","DOI":"10.1016\/j.cor.2011.01.001"},{"key":"347_CR12","first-page":"287","volume":"3221","author":"L Epstein","year":"2004","unstructured":"Epstein L, Van Stee R (2004) On variable-sized multidimensional packing. Lect Notes Artif Intell Lect Notes Bioinform 3221:287\u2013298","journal-title":"Lect Notes Artif Intell Lect Notes Bioinform"},{"issue":"1","key":"347_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) An APTAS for generalized cost variable sized bin packing. SIAM J Comput 38(1):411\u2013428","journal-title":"SIAM J Comput"},{"key":"347_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/11902140_14","volume":"4263","author":"G Ertek","year":"2006","unstructured":"Ertek G, Kilic K (2006) Decision support for packing in warehouses. Lect Notes Comput Sci 4263:115\u2013124","journal-title":"Lect Notes Comput Sci"},{"key":"347_CR15","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1007\/s101070100243","volume":"91","author":"SP Fekete","year":"2001","unstructured":"Fekete SP, Schepers J (2001) New classes of fast lower bounds for bin packing problems. Math Program Ser A 91:1131","journal-title":"Math Program Ser A"},{"key":"347_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60:311\u2013329","journal-title":"Math Methods Oper Res"},{"key":"347_CR17","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:569\u2013587","journal-title":"Oper Res"},{"key":"347_CR18","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"DK Friesen","year":"1986","unstructured":"Friesen DK, Langston MA (1986) Variable sized bin packing. SIAM J Comput 15:222\u2013230","journal-title":"SIAM J Comput"},{"key":"347_CR19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ejor.2011.10.018","volume":"218","author":"F Furini","year":"2012","unstructured":"Furini F, Malaguti E, Medina R, Persiani A, Toth P (2012) A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur J Oper Res 218:251\u2013260","journal-title":"Eur J Oper Res"},{"key":"347_CR20","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"347_CR21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1963","unstructured":"Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem\u2014part II. Oper Res 13:94\u2013119","journal-title":"Oper Res"},{"issue":"1","key":"347_CR22","first-page":"77","volume":"2","author":"E Hopper","year":"2002","unstructured":"Hopper E, Turton CH (2002) An empirical study of meta-Heuristics applied to 2D rectangular bin packing. Studia Informatica 2(1):77\u201392","journal-title":"Studia Informatica"},{"issue":"3","key":"347_CR23","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J Comput 15(3):310\u2013319","journal-title":"INFORMS J Comput"},{"key":"347_CR24","doi-asserted-by":"crossref","unstructured":"Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 40:256\u2013267","DOI":"10.1287\/opre.48.2.256.12386"},{"issue":"1","key":"347_CR25","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(1):388\u2013399","journal-title":"Manag Sci"},{"key":"347_CR26","doi-asserted-by":"crossref","unstructured":"Monaci M (2002) Algorithms for packing and scheduling problems. PhD Thesis, University of Bologna","DOI":"10.1007\/s10288-002-0011-1"},{"issue":"2","key":"347_CR27","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2009.07.024","volume":"203","author":"FG Ortmann","year":"2010","unstructured":"Ortmann FG, Ntene N, van Vuuren JH (2010) New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. Eur J Oper Res 203(2):306\u2013335","journal-title":"Eur J Oper Res"},{"issue":"2","key":"347_CR28","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.disopt.2005.01.002","volume":"2","author":"D Pisinger","year":"2005","unstructured":"Pisinger D, Sigurd M (2005) The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optim 2(2):154\u2013167","journal-title":"Discrete Optim"},{"key":"347_CR29","doi-asserted-by":"crossref","unstructured":"Seiden SS, van Stee R (2003) New bounds for multidimensional packing. Algorithmica 36(3):261\u2013293","DOI":"10.1007\/s00453-003-1016-7"},{"issue":"3","key":"347_CR30","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, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"2","key":"347_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ejor.2009.05.040","volume":"202","author":"Y Wu","year":"2010","unstructured":"Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202(2):347\u2013355","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0347-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-013-0347-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-013-0347-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,27]],"date-time":"2019-07-27T02:48:34Z","timestamp":1564195714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-013-0347-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["347"],"URL":"https:\/\/doi.org\/10.1007\/s00291-013-0347-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}