{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T22:38:45Z","timestamp":1715207925293},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0167-6377(95)00021-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:07:44Z","timestamp":1027602464000},"page":"7-13","source":"Crossref","is-referenced-by-count":5,"title":["A proof of the optimality of the MIN paging algorithm using linear programming duality"],"prefix":"10.1016","volume":"18","author":[{"given":"Ariel","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Walter A.","family":"Burkhard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-6377(95)00021-B_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","article-title":"A study of replacement algorithms for virtual storage computers","volume":"5","author":"Belady","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/0167-6377(95)00021-B_BIB2","series-title":"Operating Systems Theory","author":"Coffman","year":"1973"},{"key":"10.1016\/0167-6377(95)00021-B_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01324874","article-title":"Minimizing the number of tool switches on a flexible machine","volume":"6","author":"Crama","year":"1994","journal-title":"Int. J. Flexible Manuf. Syst."},{"issue":"4","key":"10.1016\/0167-6377(95)00021-B_BIB4","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","article-title":"Competitive paging algorithms","volume":"12","author":"Fiat","year":"1991","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0167-6377(95)00021-B_BIB5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","article-title":"Evaluation techniques for storage hierarchies","volume":"9","author":"Mattson","year":"1970","journal-title":"IBM Systems J."},{"key":"10.1016\/0167-6377(95)00021-B_BIB6","article-title":"A strongly competitive randomized paging algorithm","author":"McGeoch","year":"1989"},{"key":"10.1016\/0167-6377(95)00021-B_BIB7","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0167-6377(95)00021-B_BIB8","article-title":"Competitive paging and dual-guided on-line weighted catching and matching algorithms","author":"Young","year":"1991"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500021B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500021B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:27:49Z","timestamp":1556573269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779500021B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["016763779500021B"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00021-b","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}