乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T12:55:15Z","timestamp":1694523315787},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:00:00Z","timestamp":1582243200000},"content-version":"am","delay-in-days":235,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-12-1-0999","N00014-16-1-2786"],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2018.12.044","type":"journal-article","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T07:12:11Z","timestamp":1546413131000},"page":"65-78","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["The K-server problem via a modern optimization lens"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1985-1003","authenticated-orcid":false,"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8585-6566","authenticated-orcid":false,"given":"Patrick","family":"Jaillet","sequence":"additional","affiliation":[]},{"given":"Nikita","family":"Korolko","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2018.12.044_bib0001","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-012-0567-2","article-title":"Tractable stochastic analysis in high dimensions via robust optimization","volume":"134","author":"Bandi","year":"2012","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.044_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/331605.331606","article-title":"The harmonic k-server algorithm is competitive","volume":"47","author":"Bartal","year":"2000","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.044_bib0003","first-page":"681","article-title":"The design and analysis of a modified work function algorithm for solving the on-line k-server problem","volume":"29","author":"Baumgartner","year":"2012","journal-title":"Computing and informatics"},{"key":"10.1016\/j.ejor.2018.12.044_bib0004","series-title":"Linear programming and network flows","author":"Bazaraa","year":"2011"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0005","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","article-title":"Adjustable robust solutions of uncertain linear programs","volume":"99","author":"Ben-Tal","year":"2004","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.044_bib0006","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-006-0092-2","article-title":"Selected topics in robust convex optimization","volume":"112","author":"Ben-Tal","year":"2008","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.044_bib0007","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","article-title":"Theory and applications of robust optimization","volume":"53","author":"Bertsimas","year":"2011","journal-title":"SIAM Review"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0008","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-017-1125-8","article-title":"Data-driven robust optimization","volume":"167","author":"Bertsimas","year":"2018","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2018.12.044_bib0009","series-title":"Online computation and competitive analysis","author":"Borodin","year":"2005"},{"issue":"4","key":"10.1016\/j.ejor.2018.12.044_bib0010","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","article-title":"An optimal on-line algorithm for metrical task system","volume":"39","author":"Borodin","year":"1992","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.044_bib0011","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1006\/jagm.1996.0024","article-title":"Traversing layered graphs using the work function algorithm","volume":"20","author":"Burley","year":"1996","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0012","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","article-title":"New ressults on server problems","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2018.12.044_bib0013","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(93)90011-C","article-title":"Competitive group testing","volume":"45","author":"Du","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2018.12.044_bib0014","unstructured":"Floratos, A., & Boppana, R. (1997). The on-line k-server problem. TR1997-732, NYU, CS Department, (pp. 1\u201339)."},{"issue":"1\u20132","key":"10.1016\/j.ejor.2018.12.044_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-014-0776-y","article-title":"Distributionally robust multi-item newsvendor problems with multimodal demand distributions","volume":"152","author":"Hanasusanto","year":"2015","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2018.12.044_bib0016","series-title":"Proceedings of the fortieth annual symposium on Foundations of computer science, 1999.","first-page":"444","article-title":"Weak adversaries for the k-server problem","author":"Koutsoupias","year":"1999"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0017","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","article-title":"The k-server problem","volume":"3","author":"Koutsoupias","year":"2009","journal-title":"Computer Science Review"},{"issue":"5","key":"10.1016\/j.ejor.2018.12.044_bib0018","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","article-title":"On the k-server conjecture","volume":"42","author":"Koutsoupias","year":"1995","journal-title":"Journal of the ACM (JACM)"},{"key":"10.1016\/j.ejor.2018.12.044_bib0019","series-title":"Proceedings of the annual symposium on theoretical aspects of computer science","first-page":"581","article-title":"The CNN problem and other k-server variants","author":"Koutsoupias","year":"2000"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0020","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","article-title":"Computing in operations research using Julia","volume":"27","author":"Lubin","year":"2015","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0021","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ejor.2018.12.044_bib0022","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/dimacs\/007\/05","article-title":"A statistical adversary for on-line algorithms","volume":"7","author":"Raghavan","year":"1992","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2018.12.044_bib0023","series-title":"Proceedings of the international colloquium on automata, languages, and programming","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","author":"Raghavan","year":"1989"},{"issue":"1","key":"10.1016\/j.ejor.2018.12.044_bib0024","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","article-title":"A fast work function algorithm for solving the k-server problem","volume":"21","author":"Rudec","year":"2013","journal-title":"Central European Journal of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2018.12.044_bib0025","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communications of the ACM"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221718311184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T03:13:08Z","timestamp":1618715588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221718311184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221718311184"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.044","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The K-server problem via a modern optimization lens","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2018.12.044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}