{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:40Z","timestamp":1759638100318,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.3-VEKOP-16-2017-00002","EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002","EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.1-16-2016-00015","SNN 129178"],"award-info":[{"award-number":["EFOP-3.6.1-16-2016-00015","SNN 129178"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["SNN 129364"],"award-info":[{"award-number":["SNN 129364"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10878-021-00797-z","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T15:06:03Z","timestamp":1629731163000},"page":"613-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lower bounds for batched bin packing"],"prefix":"10.1007","volume":"43","author":[{"given":"J\u00e1nos","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"797_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"1","author":"J Balogh","year":"2012","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2012) New lower bounds for certain bin packing algorithms. Theor Comput Sci 1:1\u201313","journal-title":"Theor Comput Sci"},{"key":"797_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.disopt.2016.04.007","volume":"21","author":"J Balogh","year":"2016","unstructured":"Balogh J, B\u00e9k\u00e9si J, D\u00f3sa G, Galambos G, Tan Z (2016) Lower bound for 3-batched bin packing. Discrete Optim 21:14\u201324","journal-title":"Discrete Optim"},{"key":"797_CR3","unstructured":"Balogh J, B\u00e9k\u00e9si J, D\u00f3sa G, Epstein L, Levin A (2018) A new and improved algorithm for online bin packing. In: Proceedings of the 26th European symposium on algorithms (ESA2018), pp 5:1\u20135:14"},{"issue":"8","key":"797_CR4","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1007\/s00224-019-09915-1","volume":"63","author":"J Balogh","year":"2019","unstructured":"Balogh J, B\u00e9k\u00e9si J, D\u00f3sa G, Epstein L, Levin A (2019a) Lower bounds for several online variants of bin packing. Theory Comput Syst 63(8):1757\u20131780","journal-title":"Theory Comput Syst"},{"key":"797_CR5","doi-asserted-by":"crossref","unstructured":"Balogh J, B\u00e9k\u00e9si J, D\u00f3sa G, Epstein L, Levin A (2019b) A new lower bound for classic online bin packing. In: Proceedings of the 17th workshop on approximation and online algorithms (WAOA2019), pp 18\u201328","DOI":"10.1007\/978-3-030-39479-0_2"},{"key":"797_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ic.2016.06.001","volume":"249","author":"J B\u00e9k\u00e9si","year":"2016","unstructured":"B\u00e9k\u00e9si J, D\u00f3sa G, Epstein L (2016) Bounds for online bin packing with cardinality constraints. Inf Comput 249:190\u2013204","journal-title":"Inf Comput"},{"key":"797_CR7","unstructured":"Brown DJ (1979) A lower bound for on-line one-dimensional bin packing algorithms. Coordinated Science Laboratory Report no. R-864 (UILU-ENG 78-2257)"},{"key":"797_CR8","volume-title":"Handbook of approximation algorithms and metaheuristics, Chapter 32","author":"EG Coffman Jr","year":"2007","unstructured":"Coffman EG Jr, Csirik J (2007) Performance guarantees for one-dimensional bin packing. In: Gonzalez TF (ed) Handbook of approximation algorithms and metaheuristics, Chapter 32. Chapman & Hall\/CRC, Boston"},{"issue":"2","key":"797_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-015-0431-3","volume":"20","author":"G D\u00f3sa","year":"2017","unstructured":"D\u00f3sa G (2017) Batched bin packing revisited. J Sched 20(2):199\u2013209","journal-title":"J Sched"},{"issue":"2","key":"797_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.orl.2016.02.006","volume":"44","author":"L Epstein","year":"2016","unstructured":"Epstein L (2016) More on batched bin packing. Oper Res Lett 44(2):273\u2013277","journal-title":"Oper Res Lett"},{"issue":"3","key":"797_CR11","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/s10878-019-00423-z","volume":"38","author":"L Epstein","year":"2019","unstructured":"Epstein L (2019) A lower bound for online rectangle packing. J Comb Optim 38(3):846\u2013866","journal-title":"J Comb Optim"},{"issue":"3","key":"797_CR12","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1137\/0607041","volume":"7","author":"G Galambos","year":"1986","unstructured":"Galambos G (1986) Parametric lower bound for on-line bin-packing. SIAM J Algebraic Discrete Methods 7(3):362\u2013367","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"797_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.disopt.2004.11.001","volume":"2","author":"G Gutin","year":"2005","unstructured":"Gutin G, Jensen T, Yeo A (2005) Batched bin packing. Discrete Optim 2(1):71\u201382","journal-title":"Discrete Optim"},{"key":"797_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:256\u2013278","journal-title":"SIAM J Comput"},{"issue":"2","key":"797_CR15","doi-asserted-by":"publisher","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 on-line bin packing. Inf Process Lett 10(2):76\u201379","journal-title":"Inf Process Lett"},{"issue":"5","key":"797_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A van Vliet","year":"1992","unstructured":"van Vliet A (1992) An improved lower bound for online bin packing algorithms. Inf Process Lett 43(5):277\u2013284","journal-title":"Inf Process Lett"},{"key":"797_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"ACC Yao","year":"1980","unstructured":"Yao ACC (1980) New algorithms for bin packing. J ACM 27:207\u2013227","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00797-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00797-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00797-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:05:45Z","timestamp":1648587945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00797-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["797"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00797-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"13 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no software for this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"There are no conflicts of interest or competing interests for this work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}