{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T09:28:52Z","timestamp":1694510932732},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,15]],"date-time":"2014-03-15T00:00:00Z","timestamp":1394841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10479-014-1572-z","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T03:45:22Z","timestamp":1395114322000},"page":"55-76","source":"Crossref","is-referenced-by-count":2,"title":["Relations between capacity utilization, minimal bin size and bin number"],"prefix":"10.1007","volume":"217","author":[{"given":"Torsten","family":"Buchwald","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirsten","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guntram","family":"Scheithauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,15]]},"reference":[{"key":"1572_CR1","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1111\/j.1475-3995.2009.00713.x","volume":"16","author":"G Belov","year":"2009","unstructured":"Belov, G., Kartak, V., Rohling, H., & Scheithauer, G. (2009). One-dimensional relaxations and lp bounds for orthogonal packing. International Transactions in Operational Research, 16, 745\u2013766.","journal-title":"International Transactions in Operational Research"},{"key":"1572_CR2","unstructured":"Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., & Trystram, D. (2009). Approximation algorithm for multiple strip packing. IT University of Copenhagen, Denmark, 7th WAOA."},{"key":"1572_CR3","unstructured":"Buchwald, T., & Scheithauer, G., (2012). A note on, Relations between capacity utilization and minimal bin number. Preprint MATH-NM-05-2012, Technische Universit\u00e4t Dresden."},{"key":"1572_CR4","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. Computers & Operations Research, 34, 2223\u20132250.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1572_CR5","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman","year":"1980","unstructured":"Coffman, E. G., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808\u2013826.","journal-title":"SIAM Journal on Computing"},{"key":"1572_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58165-6","volume-title":"Cutting and packing in production and distribution","author":"H Dyckhoff","year":"1992","unstructured":"Dyckhoff, H., & Finke, U. (1992). Cutting and packing in production and distribution. Heidelberg: Physica Verlag."},{"issue":"2","key":"1572_CR7","doi-asserted-by":"crossref","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":"1572_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"1572_CR9","unstructured":"Hoffmann, K., Scheithauer, G. (2012). Relations between capacity utilization and minimal bin number. Preprint MATH-NM-03-2012, Technische Universit\u00e4t Dresden."},{"key":"1572_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K Jansen","year":"2007","unstructured":"Jansen, K., & Zhang, G. (2007). Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47, 323\u2013342.","journal-title":"Algorithmica"},{"issue":"5","key":"1572_CR11","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1137\/0219059","volume":"19","author":"K Li","year":"1990","unstructured":"Li, K., & Cheng, K. H. (1990). On three-dimensional packing. SIAM Journal on Computing, 19(5), 847\u2013867.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"1572_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., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241\u2013252.","journal-title":"European Journal of Operational Research"},{"key":"1572_CR13","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. Management Science, 44, 388\u2013399.","journal-title":"Management Science"},{"key":"1572_CR14","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A Meir","year":"1968","unstructured":"Meir, A., & Moser, L. (1968). On packing of squares and cubes. Journal of Combinatorial Theory, 5, 126\u2013134.","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"1572_CR15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A Steinberg","year":"1997","unstructured":"Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401\u2013409.","journal-title":"SIAM Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1572-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1572-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1572-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:48Z","timestamp":1559153388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1572-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,15]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["1572"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1572-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,15]]}}}