{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:48:16Z","timestamp":1754020096087},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T00:00:00Z","timestamp":1233273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00607-008-0023-6","type":"journal-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T02:09:07Z","timestamp":1233194947000},"page":"139-148","source":"Crossref","is-referenced-by-count":7,"title":["Improved lower bounds for semi-online bin packing problems"],"prefix":"10.1007","volume":"84","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":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mih\u00e1ly Csaba","family":"Mark\u00f3t","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/050647049","volume":"38","author":"J Balogh","year":"2008","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G, Reinelt G (2008) Lower bound for bin packing problem with restricted repacking. SIAM J Comput 38: 398\u2013410","journal-title":"SIAM J Comput"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-1-4757-3023-4_3","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman","year":"1999","unstructured":"Coffman EG, Galambos G, Martello S, Vigo D (1999) Bin packing approximation algorithms: combinatorial analysis. In: Du DZ, Pardalos PM (eds) Handbook of Combinatorial Optimization. Kluwer, Dordrecht, pp 151\u2013208"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0212014","volume":"12","author":"EG Coffmann","year":"1983","unstructured":"Coffmann EG, Garey MR, Johnson DS (1983) Dynamic bin packing. SIAM J Comput 12: 227\u2013260","journal-title":"SIAM J Comput"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online algorithms: the state of the art. Lecture Notes in Computer Science, vol 1442","author":"J Csirik","year":"1998","unstructured":"Csirik J, Woeginger GJ (1998) Online packing and covering problems. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, pp 147\u2013177"},{"issue":"4","key":"23_CR5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.disopt.2008.04.003","volume":"5","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) More on online bin packing with two item sizes. Discrete Optim 5(4): 705\u2013713","journal-title":"Discrete Optim"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G Galambos","year":"1993","unstructured":"Galambos G, Woeginger GJ (1993) Repacking helps in bounded space online bin packing. Computing 49: 329\u2013338","journal-title":"Computing"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1137\/S0097539799180408","volume":"30","author":"G Gambosi","year":"2000","unstructured":"Gambosi G, Postiglione A, Talamo M (2000) Algorithms for the relaxed online bin-packing model. SIAM J Comput 30: 1532\u20131551","journal-title":"SIAM J Comput"},{"key":"23_CR8","volume-title":"Computers and intractability (A guide to the theory of NP-completeness)","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability (A guide to the theory of NP-completeness). W.H. Freeman, San Francisco"},{"key":"23_CR9","unstructured":"Grove EF (1995) Online bin packing with lookahead. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 430\u2013436"},{"key":"23_CR10","doi-asserted-by":"crossref","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: 71\u201382","journal-title":"Discrete Optim"},{"key":"23_CR11","first-page":"2","volume":"1","author":"G Gutin","year":"2006","unstructured":"Gutin G, Jensen T, Yeo A (2006) On-line bin packing with two item sizes. Algorithmic Oper Res 1: 2","journal-title":"Algorithmic Oper Res"},{"key":"23_CR12","volume-title":"Numerical toolbox for verified computing I","author":"R Hammer","year":"1993","unstructured":"Hammer R, Hocks M, Kulisch U, Ratz D (1993) Numerical toolbox for verified computing I. Springer, Berlin"},{"key":"23_CR13","volume-title":"Global optimization using interval analysis","author":"E Hansen","year":"1992","unstructured":"Hansen E (1992) Global optimization using interval analysis. Marcel Dekker, New York"},{"key":"23_CR14","volume-title":"Handbook of global optimization","year":"1995","unstructured":"Horst R, Pardalos PM (eds) (1995) Handbook of global optimization. Kluwer, Dordrecht"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(96)00112-3","volume":"59","author":"Z Ivkovi\u010d","year":"1996","unstructured":"Ivkovi\u010d Z, Lloyd EL (1996) A fundamental restriction on fully dynamic maintenance of bin packing. Inform Process Lett 59: 229\u2013232","journal-title":"Inform Process Lett"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/S0097539794276749","volume":"28","author":"Z Ivkovi\u010d","year":"1998","unstructured":"Ivkovi\u010d Z, Lloyd EL (1998) Fully dynamic algorithms for bin packing: being (mostly) myopic helps. SIAM J Comput 28: 574\u2013611","journal-title":"SIAM J Comput"},{"key":"23_CR17","unstructured":"Kn\u00fcppel O (1993) PROFIL\u2014Programmer\u2019s Runtime Optimized Fast Interval Library. Bericht 93.4, Technische Universit\u00e4t Hamburg-Harburg"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008359223042","volume":"16","author":"MCs Mark\u00f3t","year":"2000","unstructured":"Mark\u00f3t MCs, Csendes T, Csallner AE (2000) Multisection in interval branch-and-bound methods for global optimization. II. Numerical tests. J Global Optim 16: 219\u2013228","journal-title":"J Global Optim"},{"key":"23_CR19","volume-title":"Interval analysis","author":"RE Moore","year":"1966","unstructured":"Moore RE (1966) Interval analysis. Prentice-Hall, Englewood Cliffs"},{"key":"23_CR20","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"},{"key":"23_CR21","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 online bin packing algorithms. Inform Process Lett 43: 277\u2013284","journal-title":"Inform Process Lett"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-008-0023-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-008-0023-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-008-0023-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:30:21Z","timestamp":1559125821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-008-0023-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,30]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s00607-008-0023-6","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,30]]}}}