{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:49:43Z","timestamp":1760384983561},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T00:00:00Z","timestamp":1253059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10100-009-0109-z","type":"journal-article","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T07:51:11Z","timestamp":1253001071000},"page":"221-239","source":"Crossref","is-referenced-by-count":16,"title":["A note on online hypercube packing"],"prefix":"10.1007","volume":"18","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,16]]},"reference":[{"key":"109_CR1","unstructured":"Brown DJ (1979) A lower bound for on-line one-dimensional bin packing algorithms. Technical report R864, Coordinated Science Laboratory, Urbana, Illinois"},{"key":"109_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","volume":"8","author":"D Coppersmith","year":"1989","unstructured":"Coppersmith D, Paghavan P (1989) Multidimensional on-line bin packing: algorithms and worst case analysis. Oper Res Lett 8: 17\u201320","journal-title":"Oper Res Lett"},{"key":"109_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J Csirik","year":"1993","unstructured":"Csirik J, van Vliet A (1993) An on-line algorithm for multidimensional bin packing. Oper Res Lett 13: 149\u2013158","journal-title":"Oper Res Lett"},{"issue":"2","key":"109_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/S0097539705446895","volume":"35","author":"L Epstein","year":"2005","unstructured":"Epstein L, van Stee R (2005a) Optimal online algorithms for multidimensional packing problems. SIAM J Comput 35(2): 431\u2013448","journal-title":"SIAM J Comput"},{"issue":"9","key":"109_CR5","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s00236-005-0169-z","volume":"41","author":"L Epstein","year":"2005","unstructured":"Epstein L, van Stee R (2005b) Online square and cube packing. Acta Inform 41(9): 595\u2013606","journal-title":"Acta Inform"},{"issue":"2","key":"109_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.disopt.2006.11.005","volume":"4","author":"L Epstein","year":"2007","unstructured":"Epstein L, van Stee R (2007) Bounds for online bounded space hypercube packing. Discrete Optimization 4(2): 185\u2013197","journal-title":"Discrete Optimization"},{"issue":"4","key":"109_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers AJ, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4): 299\u2013325","journal-title":"SIAM J Comput"},{"key":"109_CR8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","volume":"10","author":"FM Liang","year":"1980","unstructured":"Liang FM (1980) A lower bound for online bin packing. Inform Process Lett 10: 76\u201379","journal-title":"Inform Process Lett"},{"key":"109_CR9","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee CC, Lee DT (1985) A simple on-line bin-packing algorithm. J ACM 32: 562\u2013572","journal-title":"J ACM"},{"issue":"297","key":"109_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0304-3975(02)00647-3","volume":"1-3","author":"FK Miyazawa","year":"2003","unstructured":"Miyazawa FK, Wakabayashi Y (2003) Cube packing. Theor Comput Sci 1-3(297): 355\u2013366","journal-title":"Theor Comput Sci"},{"key":"109_CR11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"PV Ramanan","year":"1989","unstructured":"Ramanan PV, Brown DJ, Lee CC, Lee DT (1989) On-line bin packing in linear time. J Algorithm 10: 305\u2013326","journal-title":"J Algorithm"},{"key":"109_CR12","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden SS (2002) On the online bin packing problem. J ACM 49: 640\u2013671","journal-title":"J ACM"},{"issue":"3","key":"109_CR13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"SS Seiden","year":"2003","unstructured":"Seiden SS, van Stee R (2003) New bounds for multidimensional packing. Algorithmica 36(3): 261\u2013293","journal-title":"Algorithmica"},{"key":"109_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A Vliet van","year":"1992","unstructured":"van Vliet A (1992) An improved lower bound for on-line bin packing algorithms. Inform Process Lett 43: 277\u2013284","journal-title":"Inform Process Lett"},{"key":"109_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"AC-C Yao","year":"1980","unstructured":"Yao AC-C (1980) New algorithms for bin packing. J ACM 27: 207\u2013227","journal-title":"J ACM"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-009-0109-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-009-0109-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-009-0109-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:26Z","timestamp":1559123366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-009-0109-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,16]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s10100-009-0109-z","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,16]]}}}