{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:38:19Z","timestamp":1725496699348},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_21","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"210-220","source":"Crossref","is-referenced-by-count":2,"title":["Two-Dimensional On-Line Bin Packing Problem with Rotatable Items"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Hada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"D. Blitz, A. van Vliet, and G. J. Woeginger. Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms. unpublished manuscript, 1996.","DOI":"10.1006\/jagm.1996.0005"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D. Coppersmith","year":"1989","unstructured":"D. Coppersmith and P. Raghavan. Multidimensional on-line bin packing: Algorithms and worst case analysis. Oper. Res. Lett., 8:17\u201320, 1989.","journal-title":"Oper. Res. Lett."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J. Csirik","year":"1993","unstructured":"J. Csirik and A. van Vliet. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett., 13:149\u2013158, 1993.","journal-title":"Oper. Res. Lett."},{"key":"21_CR4","volume-title":"Computers and Intractability: A Guide for the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide for the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979."},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. C. Lee","year":"1985","unstructured":"C. C. Lee and D. T. Lee. A simple on-line bin packing algorithm. J. Assoc. Comput. Mach., 32:562\u2013572, 1985.","journal-title":"J. Assoc. Comput. Mach."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","volume":"34","author":"M. B. Richey","year":"1991","unstructured":"M. B. Richey. Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math., 34:203\u2013227, 1991.","journal-title":"Discrete Appl. Math."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet van","year":"1992","unstructured":"A. van Vliet. An improved lower bound for on-line bin packing algorithms. Information Processing Letters, 43:277\u2013284, 1992.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T04:17:07Z","timestamp":1557029827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}