{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T03:30:43Z","timestamp":1775446243311,"version":"3.50.1"},"reference-count":1,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00072-8","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T18:47:16Z","timestamp":1056134836000},"page":"803-805","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":75,"title":["A polynomial-time algorithm for finding \u03b5 in DEA models"],"prefix":"10.1016","volume":"31","author":[{"given":"Gholam R.","family":"Amin","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Toloo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(03)00072-8_BIB1","doi-asserted-by":"crossref","first-page":"3444","DOI":"10.1287\/opre.48.2.344.12381","article-title":"An assurance interval for the non-Archimedean epsilon in DEA models","volume":"48","author":"Mehrabian","year":"2000","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T07:41:23Z","timestamp":1759650083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":1,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000728"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00072-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A polynomial-time algorithm for finding \u03b5 in DEA models","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0305-0548(03)00072-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}