{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:43:47Z","timestamp":1743137027192,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_27","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"201-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Lower Bounds for the Three-Dimensional Strip Packing Problem"],"prefix":"10.1007","author":[{"given":"Kirsten","family":"Hoffmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00291-008-0128-5","volume":"31","author":"R Alvarez-Vald\u00e9s","year":"2009","unstructured":"Alvarez-Vald\u00e9s, R., Parre\u00f1o, F., & Tamarit, J. M. (2009). A branch and bound algorithm for the strip packing problem. OR Spectrum, 31(2), 431\u2013459.","journal-title":"OR Spectrum"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1057\/jors.1985.10","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley, J. E. (1985). Bounds for two-dimensional cutting. The Journal of the Operational Research Society, 36(1), 71\u201374.","journal-title":"The Journal of the Operational Research Society"},{"issue":"6","key":"27_CR3","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1111\/j.1475-3995.2009.00713.x","volume":"16","author":"G Belov","year":"2009","unstructured":"Belov, G., Kartak, V. M., Rohling, H., & Scheithauer, G. (2009). One-dimensional relaxations and LP bounds for orthogonal packing. International Transactions in Operational Research, 16(6), 745\u2013766.","journal-title":"International Transactions in Operational Research"},{"key":"27_CR4","unstructured":"Belov G., Scheithauer G. (2011) Gaps between optimal values of some packing and scheduling problems. Technische Universit\u00e4t Dresden."},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.dam.2003.08.004","volume":"140","author":"MA Boschetti","year":"2004","unstructured":"Boschetti, M. A. (2004). New lower bounds for the three-dimensional finite bin packing problem. Discrete Applied Mathematics, 140(1), 241\u2013258.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10288-002-0005-z","volume":"1","author":"MA Boschetti","year":"2003","unstructured":"Boschetti, M. A., & Mingozzi, A. (2003). The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR: A Quarterly Journal of Operations Research, 1(1), 27\u201342.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10288-002-0006-y","volume":"1","author":"MA Boschetti","year":"2003","unstructured":"Boschetti, M. A., & Mingozzi, A. (2003). The two-dimensional finite bin packing problem. Part II: New lower and upper bounds. 4OR: A Quarterly Journal of Operations Research, 1(2), 135\u2013147.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"6","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1287\/opre.1100.0833","volume":"58","author":"MA Boschetti","year":"2010","unstructured":"Boschetti, M. A., & Montaletti, L. (2010). An exact algorithm for the two-dimensional strip-packing problem. Operations Research, 58(6), 1774\u20131791.","journal-title":"Operations Research"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Buchwald, T., Hoffmann, K., & Scheithauer, G. (2013). Relations between capacity utilization and minimal bin number. Technical Report, TU Dresden.","DOI":"10.1007\/s10479-014-1572-z"},{"issue":"8","key":"27_CR10","doi-asserted-by":"publisher","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. Computers and Operations Research, 34(8), 2223\u20132250.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","volume":"80","author":"C Chen","year":"1995","unstructured":"Chen, C., Lee, S., & Shen, Q. (1995). An analytical model for the container loading problem. European Journal Of Operational Research, 80(1), 68\u201376.","journal-title":"European Journal Of Operational Research"},{"issue":"5","key":"27_CR12","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s11390-008-9170-7","volume":"23","author":"F Diedrich","year":"2008","unstructured":"Diedrich, F., Harren, R., Jansen, K., Th\u00f6le, R., & Thomas, H. (2008). Approximation algorithms for 3D orthogonal Knapsack. Journal of Computer Science and Technology, 23(5), 749\u2013762.","journal-title":"Journal of Computer Science and Technology"},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44(2), 145\u2013159.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete, S. P., & Schepers, J. (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60(2), 311\u2013329.","journal-title":"Mathematical Methods of Operations Research"},{"key":"27_CR15","unstructured":"Hoffmann, K. (2012). Das Streifenpackproblem: Untere Schranken und ihre G\u00fcte. Masters thesis, TU Dresden."},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C Kenyon","year":"2000","unstructured":"Kenyon, C., & R\u00e9mila, E. (2000). A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4), 645\u2013656.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","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 Journal on Computing, 15(3), 310\u2013319.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48(2), 256\u2013267.","journal-title":"Operations Research"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28(1), 59\u201370.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001860000066","volume":"52","author":"M Padberg","year":"2000","unstructured":"Padberg, M. (2000). Packing small boxes into a big box. Mathematical Methods of Operations Research, 52(1), 1\u201321.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:05:43Z","timestamp":1676873143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_27","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}