{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:15:44Z","timestamp":1743146144364,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_34","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"387-401","source":"Crossref","is-referenced-by-count":0,"title":["Online Bin Packing with (1,1) and (2,R) Bins"],"prefix":"10.1007","author":[{"given":"Jing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput.\u00a038(1), 411\u2013428 (2008)","journal-title":"SIAM J. Comput."},{"key":"34_CR2","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithm for bin packing. Journal of Computer and System Sciences\u00a08, 272\u2013314 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput.\u00a03, 256\u2013278 (1974)","journal-title":"SIAM J. Comput."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. J. ACM\u00a027, 207\u2013227 (1980)","journal-title":"J. ACM"},{"key":"34_CR6","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms. PWS Publishing Company (1997)"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM\u00a032(3), 256\u2013278 (1985)","journal-title":"J. ACM"},{"issue":"5","key":"34_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet Van","year":"1992","unstructured":"Van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Information Processing Letters\u00a043(5), 277\u2013284 (1992)","journal-title":"Information Processing Letters"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM\u00a049, 640\u2013671 (2002)","journal-title":"J. ACM"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S., Van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM J. Comput.\u00a032(2), 455\u2013469 (2002)","journal-title":"SIAM J. Comput."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesten","year":"1986","unstructured":"Friesten, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput.\u00a015, 222\u2013230 (1986)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0166-218X(88)90089-3","volume":"22","author":"N.G. Kinnerseley","year":"1988","unstructured":"Kinnerseley, N.G., Langston, M.A.: Online variable-sized bin packing. Discrete Applied Mathematics\u00a022(2), 143\u2013148 (1988)","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"34_CR13","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J. Csirik","year":"1989","unstructured":"Csirik, J.: An on-line algorithm for variable-sized bin packing. Acta Informatica\u00a026(8), 697\u2013709 (1989)","journal-title":"Acta Informatica"},{"key":"34_CR14","unstructured":"Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms. Tech. report -864. Coordinated Science Laboratory Urbana IL (1979)"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","volume":"10","author":"F.M. Liang","year":"1980","unstructured":"Liang, F.M.: A lower bound for on-line bin packing. Information Processing Letters\u00a010, 76\u201379 (1980)","journal-title":"Information Processing Letters"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet Van","year":"1992","unstructured":"Van Vliet, A.: An improved lower bound for online bin packing algorithm. Inform. Process. Lett.\u00a043, 277\u2013284 (1992)","journal-title":"Inform. Process. Lett."},{"key":"34_CR17","volume-title":"Lower and upper bounds for online bin packing and scheduling heuristics","author":"A. Vliet Van","year":"1995","unstructured":"Van Vliet, A.: Lower and upper bounds for online bin packing and scheduling heuristics. Thesis Publishers, Amsterdam (1995)"},{"key":"34_CR18","unstructured":"Blitz, D., Van Vliet, A., Woeginger, G.J.: Lower bounds on the asymptotic worst-case ratio of online bin packing algorithms (1996) (unpublished manuscript)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J.M. Valerio de Carvalho","year":"2002","unstructured":"Valerio de Carvalho, J.M.: LP models for bin packing and cutting stock problem. European Journal of Operational Research\u00a0141, 253\u2013273 (2002)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:39:47Z","timestamp":1558687187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}