{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T15:47:30Z","timestamp":1771861650692,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,13]],"date-time":"2013-11-13T00:00:00Z","timestamp":1384300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9679-8","type":"journal-article","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T03:34:08Z","timestamp":1384227248000},"page":"67-87","source":"Crossref","is-referenced-by-count":17,"title":["Improved lower bounds for the online bin packing problem with cardinality constraints"],"prefix":"10.1007","volume":"29","author":[{"given":"Hiroshi","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"Koji","family":"Kobayashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,13]]},"reference":[{"key":"9679_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440\u2013441","author":"J Balogh","year":"2012","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440\u2013441:1\u201313","journal-title":"Theor Comput Sci"},{"issue":"1\u20133","key":"9679_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.dam.2003.05.006","volume":"143","author":"L Babel","year":"2004","unstructured":"Babel L, Chen B, Kellerer H, Kotov V (2004) Algorithms for on-line bin-packing problems with cardinality constraints. Discret Appl Math 143(1\u20133):238\u2013251","journal-title":"Discret Appl Math"},{"key":"9679_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"1","key":"9679_CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/nav.10058","volume":"50","author":"A Caprara","year":"2003","unstructured":"Caprara A, Kellerer H, Pferschy U (2003) Approximation schemes for ordered vector packing problems. Naval Res Logist 50(1):58\u201369","journal-title":"Naval Res Logist"},{"issue":"6","key":"9679_CR5","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1137\/090767613","volume":"20","author":"L Epstein","year":"2010","unstructured":"Epstein L, Levin A (2010) AFPTAS results for common variants of bin packing: a new method for handling the small items. SIAM J Optim 20(6):3121\u20133145","journal-title":"SIAM J Optim"},{"issue":"4","key":"9679_CR6","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/050639065","volume":"20","author":"L Epstein","year":"2006","unstructured":"Epstein L (2006) Online bin packing with cardinality constraints. SIAM J Discret Math 20(4):1015\u20131030","journal-title":"SIAM J Discret Math"},{"key":"9679_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H Kellerer","year":"1999","unstructured":"Kellerer H, Pferschy U (1999) Cardinality constrained bin-packing problems. Ann Oper Res 92:335\u2013348","journal-title":"Ann Oper Res"},{"issue":"4","key":"9679_CR8","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/321906.321917","volume":"22","author":"KL Krause","year":"1975","unstructured":"Krause KL, Shen VY, Schwetman HD (1975) Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J ACM 22(4):522\u2013550","journal-title":"J ACM"},{"issue":"3","key":"9679_CR9","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/322017.322032","volume":"24","author":"KL Krause","year":"1977","unstructured":"Krause KL, Shen VY, Schwetman HD (1977) Errata: \u201canalysis of several task-scheduling algorithms for a model of multiprogramming computer systems\u201d. J ACM 24(3):527","journal-title":"J ACM"},{"issue":"3","key":"9679_CR10","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 Algorithms 10(3):305\u2013326","journal-title":"J Algorithms"},{"issue":"5","key":"9679_CR11","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(5):640\u2013671","journal-title":"J ACM"},{"issue":"2","key":"9679_CR12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"issue":"5","key":"9679_CR13","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. Inf Process Lett 43(5):277\u2013284","journal-title":"Inf Process Lett"},{"issue":"2","key":"9679_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"AC Yao","year":"1980","unstructured":"Yao AC (1980) New algorithms for bin packing. J ACM 27(2):207\u2013227","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9679-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9679-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9679-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:22Z","timestamp":1559276602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9679-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,13]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9679"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9679-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,13]]}}}