{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:12:37Z","timestamp":1762323157158},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T00:00:00Z","timestamp":1190160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10288-007-0051-7","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T06:18:56Z","timestamp":1190096336000},"page":"361-374","source":"Crossref","is-referenced-by-count":17,"title":["A branch-and-price algorithm for the two-dimensional level strip packing problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Andrea","family":"Bettinelli","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,19]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO and Wang PY (1987). Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38: 423\u2013429","journal-title":"J Oper Res Soc"},{"key":"51_CR2","unstructured":"Bettinelli A, Ceselli A (2007) Experimental evaluation of a branch-and-price algorithm for the bi-dimensional level strip packing problem. Technical report n. 103, Dipartimento di Tecnologie dell\u2019Informazione, Universit\u00e0 degli Studi di Milano"},{"key":"51_CR3","unstructured":"Ceselli A (2003). Two exact algorithms for the capacitated p-median problem. 4OR 1(4): 319\u2013340"},{"issue":"4","key":"51_CR4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.orl.2005.06.001","volume":"34","author":"A Ceselli","year":"2006","unstructured":"Ceselli A and Righini G (2006). An optimization algorithm for a penalized knapsack problem. Oper Res Lett 34(4): 394\u2013404","journal-title":"Oper Res Lett"},{"key":"51_CR5","volume-title":"Column Generation","year":"2005","unstructured":"Desaulniers G, Desrosiers J and Solomon MM (eds) (2005). Column Generation. Springer, Heidelberg"},{"key":"51_CR6","first-page":"393","volume-title":"Cutting and packing","author":"H Dickhoff","year":"1997","unstructured":"Dickhoff H, Scheithauer G and Terno J (1997). Cutting and packing. Wiley, New York, 393\u2013413"},{"key":"51_CR7","unstructured":"Fekete SP, Schepers J (1997) On higher-dimensional packing iii: Exact algorithms. Technical Report 97\u2013290"},{"key":"51_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete SP and Schepers J (2004). A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29: 353\u2013368","journal-title":"Math Oper Res"},{"issue":"2","key":"51_CR9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete SP and Schepers J (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60(2): 311\u2013329","journal-title":"Math Methods Oper Res"},{"key":"51_CR10","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR and Johnson DS (1979). Computers and Intractability: a guide to the theory of NP-completeness. WH Freeman, New York"},{"key":"51_CR11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C Kenyon","year":"2000","unstructured":"Kenyon C and R\u00e9mila E (2000). A near-optimal solution to a two-dimensional cutting stock problem. Math Oper Res 25: 645\u2013656","journal-title":"Math Oper Res"},{"key":"51_CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S and Monaci M (2002). Two-dimensional packing problems: a survey. Eur J Oper Res 141: 241\u2013252","journal-title":"Eur J Oper Res"},{"key":"51_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S and Vigo D (2002). Recent advances on two-dimensional bin packing problems. Discrete Appl Math 123: 379\u2013396","journal-title":"Discrete Appl Math"},{"key":"51_CR14","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 and Vigo D (2004). Models and bounds for two dimensional packing problems. J Comb Optim 8: 363\u2013379","journal-title":"J Comb Optim"},{"key":"51_CR15","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 and Vigo D (2003). An exact approach to the strip-packing problem. INFORMS J Comput 15: 310\u2013319","journal-title":"INFORMS J Comput"},{"issue":"3","key":"51_CR16","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello S, Pisinger D and Toth P (1999). Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manage Sci 45(3): 414\u2013424","journal-title":"Manage Sci"},{"key":"51_CR17","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S and Toth P (1990). Knapsack problems: Algorithms and computer implementations. Wiley, New York"},{"key":"51_CR18","unstructured":"Martello S, Toth P (2007) Online version of the book \u201cknapsack problems\u201d: http:\/\/www.or.deis.unibo.it\/knapsack.html. Last accessed 10\/05\/2007"},{"key":"51_CR19","volume-title":"Large scale linear and integer optimization","author":"RK Martin","year":"1998","unstructured":"Martin RK (1998). Large scale linear and integer optimization. Kluwer, Dordrecth"},{"key":"51_CR20","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger D (1997). A minimal algorithm for the 0\u20131 knapsack problem. Oper Res 45: 758\u2013767","journal-title":"Oper Res"},{"key":"51_CR21","unstructured":"Pisinger D (2007) Homepage: www.diku.dk\/~pisinger\/. Last accessed 10\/05\/2007"},{"key":"51_CR22","unstructured":"W\u00e4scher G, Haussner H, Schumann H (2006) An improved typology of cutting and packing problems. Eur J Oper Res, forthcoming, 2006"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0051-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0051-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0051-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:55Z","timestamp":1559117575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0051-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,19]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0051-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,19]]}}}