{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:26:10Z","timestamp":1774599970778,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,11]],"date-time":"2012-04-11T00:00:00Z","timestamp":1334102400000},"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":[[2014,1]]},"DOI":"10.1007\/s10878-012-9489-4","type":"journal-article","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T15:44:23Z","timestamp":1334072663000},"page":"115-131","source":"Crossref","is-referenced-by-count":16,"title":["On-line bin packing with restricted repacking"],"prefix":"10.1007","volume":"27","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":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,11]]},"reference":[{"key":"9489_CR1","doi-asserted-by":"crossref","unstructured":"Balogh J, B\u00e9k\u00e9si J (2012) Semi-on-line bin packing: a short overview and a new lower bound. Centr Eur J Oper Res. Submitted for publication","DOI":"10.1007\/s10100-012-0266-3"},{"key":"9489_CR2","first-page":"117","volume":"24","author":"J Balogh","year":"2007","unstructured":"Balogh J, Galambos G (2007) Algorithms for the on-line bin packing problem with repacking. Alkalmazott Matematikai Lapok 24:117\u2013130. In Hungarian","journal-title":"Alkalmazott Matematikai Lapok"},{"key":"9489_CR3","series-title":"LNCS","first-page":"25","volume-title":"Proceedings of WAOA 2010 (8th workshop on approximation and online algorithms)","author":"J Balogh","year":"2011","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2011) New lower bounds for certain classes of bin packing algorithms. In: Proceedings of WAOA 2010 (8th workshop on approximation and online algorithms). LNCS, vol 6534, pp 25\u201336"},{"key":"9489_CR4","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 the online bin packing problem with restricted repacking. SIAM J Comput 38:398\u2013410","journal-title":"SIAM J Comput"},{"key":"9489_CR5","unstructured":"Brown DJ (1979) A lower bound for on-line one-dimensional bin packing algorithms. Tech Rept R-864, Coordinated Science Laboratory, University of Illinois, Urbana, IL"},{"key":"9489_CR6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.tcs.2008.09.028","volume":"409","author":"JW-T Chan","year":"2008","unstructured":"Chan JW-T, Lam T-W, Wong PWH (2008) Dynamic bin packing of unit fractions items. Theor Comput Sci 409:521\u2013529","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9489_CR7","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(2):227\u2013260","journal-title":"SIAM J Comput"},{"key":"9489_CR8","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 D-Z, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Dordrecht, pp 151\u2013208"},{"key":"9489_CR9","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) On bin packing with conflicts. SIAM J Optim 19:1270\u20131298","journal-title":"SIAM J Optim"},{"key":"9489_CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within 1+\u03b5 in linear time. Combinatorica 1:349\u2013355","journal-title":"Combinatorica"},{"key":"9489_CR11","unstructured":"Galambos G (1985) A new heuristic for the classical bin packing problem. Tech Rept 82, Institut f\u00fcr Mathematik, Universit\u00e4t Augsburg"},{"key":"9489_CR12","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 on-line bin packing. Computing 49:329\u2013338","journal-title":"Computing"},{"key":"9489_CR13","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":"9489_CR14","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 and Company, New York"},{"key":"9489_CR15","unstructured":"Grove EF (1995) Online bin packing with lookahead, SODA, pp 430\u2013436"},{"key":"9489_CR16","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"},{"issue":"23","key":"9489_CR17","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/j.ipl.2010.09.002","volume":"110","author":"X Han","year":"2010","unstructured":"Han X, Peng C, Ye D, Zhang D, Lan Y (2010) Dynamic bin packing with unit fraction items revisited. Inf Process Lett 110(23):1049\u20131054","journal-title":"Inf Process Lett"},{"key":"9489_CR18","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. Inf Process Lett 59:229\u2013232","journal-title":"Inf Process Lett"},{"key":"9489_CR19","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":"9489_CR20","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"},{"key":"9489_CR21","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 on-line bin-packing. Inf Process Lett 10:76\u201379","journal-title":"Inf Process Lett"},{"key":"9489_CR22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P Ramanan","year":"1989","unstructured":"Ramanan P, Brown DJ, Lee CC, Lee DT (1989) On-line bin packing in linear time. J Algorithms 10:305\u2013326","journal-title":"J Algorithms"},{"key":"9489_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","volume":"34","author":"MB Richey","year":"1991","unstructured":"Richey MB (1991) Improved bounds for harmonic-based bin packing algorithms. Discrete Appl Math 34:203\u2013227","journal-title":"Discrete Appl Math"},{"key":"9489_CR24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.2307\/2305906","volume":"54","author":"HE Salzer","year":"1947","unstructured":"Salzer HE (1947) The approximation of numbers as sums of reciprocals. Am Math Mon 54:135\u2013142","journal-title":"Am Math Mon"},{"key":"9489_CR25","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":"9489_CR26","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: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-012-9489-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9489-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9489-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T03:43:13Z","timestamp":1561606993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9489-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9489"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9489-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,11]]}}}