{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:38Z","timestamp":1751429438453,"version":"3.41.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1021253103047","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:56:49Z","timestamp":1048208209000},"page":"449-462","source":"Crossref","is-referenced-by-count":15,"title":["On the On-line Number of Snacks Problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Weimin","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jane","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"405652_CR1","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D. and Tarjan, R.E. (1985), Amortized Efficiency of List Update and Paging Rules, Communication of the ACM 28, 202\u2013208.","journal-title":"Communication of the ACM"},{"key":"405652_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"M. Karlin","year":"1988","unstructured":"Karlin, M., Manasse, L.R. and Sleator, D.D. (1988), Competitive Snoopy Caching, Algorithmica 3, 79\u2013119.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A. and Sleator, D.D. (1988), Competitive Algorithms for On-line Problems. In Proc. 20th Annual ACM Symp. on Theory of Computing 322\u2013333.","key":"405652_CR3","DOI":"10.1145\/62212.62243"},{"key":"405652_CR4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N. and Sake, M. (1992), An Optimal On-line Algorithm for Metrical Task Systems. Journal of ACM 39, 745\u2013763.","journal-title":"Journal of ACM"},{"key":"405652_CR5","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M.S. Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A. and Sleator, D.D. (1990), Competitive Algorithms for Server Problems, Journal of Algorithms 11, 208\u2013230.","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Ben-david, S., Borodin, A., Karp, R.M., Tardos, G. and Wigderson, A. (1990), On the Power if Randomization in On-line Algorithms. In Proc. 22nd Annual ACM Symp. on Theory of Computing, 379\u2013386.","key":"405652_CR6","DOI":"10.1145\/100216.100268"},{"key":"405652_CR7","first-page":"240","volume":"81","author":"D.R. Woodall","year":"1974","unstructured":"Woodall, D.R. (1974), The Bay Restaurant: A Linear Storage Problem. American Mathematical Monthly 81, 240\u2013246.","journal-title":"American Mathematical Monthly"},{"key":"405652_CR8","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A. and Trotter, W.T. (1981), An Extremal Problem in Recursive Combinatorics, Congressus Numerantium 33, 143\u2013153.","journal-title":"Congressus Numerantium"},{"key":"405652_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C. (1980), New Algorithm for Bin Packing, J. Assoc. Comput. Mach. 27, 207\u2013227.","journal-title":"J. Assoc. Comput. Mach"},{"doi-asserted-by":"crossref","unstructured":"Albers, S. and Leonardi, S. (1999), Online Algorithms. ACM Computing Surveys.","key":"405652_CR10","DOI":"10.1145\/333580.333583"},{"doi-asserted-by":"crossref","unstructured":"El-Yaniv, R., Fiat, A., Karp, R. and Turpin, G. (1992), Competitive Analysis of Financial Games. Foundations of Computer Science, 1992. Proceedings 33rd Annual Symposium, pp. 327\u2013333.","key":"405652_CR11","DOI":"10.1109\/SFCS.1992.267758"},{"issue":"1","key":"405652_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1017982528216","volume":"21","author":"W. M. Ma","year":"2001","unstructured":"Ma, W. M., Xu, Y.F. and Wang, K.L. (2001), On-line k-Truck Problem and its Competitive Algorithm. Journal of Global Optimization 21(1), 15\u201325.","journal-title":"Journal of Global Optimization"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021253103047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021253103047\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021253103047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:40:42Z","timestamp":1751366442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021253103047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["405652"],"URL":"https:\/\/doi.org\/10.1023\/a:1021253103047","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}