{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:16:30Z","timestamp":1781518590900,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0167-6377(01)00069-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:48Z","timestamp":1027594788000},"page":"213-219","source":"Crossref","is-referenced-by-count":204,"title":["A simple efficient approximation scheme for the restricted shortest path problem"],"prefix":"10.1016","volume":"28","author":[{"given":"Dean H.","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny","family":"Raz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6377(01)00069-4_BIB1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"issue":"6","key":"10.1016\/S0167-6377(01)00069-4_BIB2","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/90.748088","article-title":"QoS routing on networks with uncertain parameters","volume":"6","author":"Lorenz","year":"1998","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0167-6377(01)00069-4_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(95)00052-6","article-title":"Errata and comments on \u201capproximation algorithms for the capacitated plant allocation problem\u201d","volume":"18","author":"Labb\u00e8","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00069-4_BIB4","doi-asserted-by":"crossref","unstructured":"C. Phillips, The network inhibition problem, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, May 1993, pp. 776\u2013785.","DOI":"10.1145\/167088.167286"},{"issue":"12","key":"10.1016\/S0167-6377(01)00069-4_BIB5","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1109\/49.898739","article-title":"Optimal partition of QoS requirements with discrete cost functions","volume":"18","author":"Raz","year":"2000","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S0167-6377(01)00069-4_BIB6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of pareto optima in multiple-objective shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000694?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000694?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:54:48Z","timestamp":1556373288000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0167637701000694"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00069-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}