{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:43:49Z","timestamp":1776105829778,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0305-0548(03)00114-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"1667-1680","source":"Crossref","is-referenced-by-count":97,"title":["An exact algorithm for the robust shortest path problem with interval data"],"prefix":"10.1016","volume":"31","author":[{"given":"R.","family":"Montemanni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.M.","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0305-0548(03)00114-X_BIB1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","article-title":"On the shortest path problem","volume":"25","author":"Yu","year":"1988","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0377-2217(99)00005-3","article-title":"Shortest path problems with partial information","volume":"121","author":"Dias","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB3","unstructured":"Kara\u015fan OE, Pinar M\u00c7, Yaman H. The robust shortest path problem with interval data. Computers and Operations Research, to appear."},{"key":"10.1016\/S0305-0548(03)00114-X_BIB4","unstructured":"Zieli\u0144ski P. The relative robust shortest path problem with interval data. Instytut Organizacji i Zarzadzania PWr., Report Serii PRE Nr. 30. European Journal of Operational Research, submitted for publication. (Available at http:\/\/mulhacen.ioz.pwr.wroc.pl\/~pziel\/publications\/reports\/ejor3.ps.)"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB5","series-title":"Robust discrete optimization and its applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","article-title":"The robust spanning tree problem with interval data","volume":"29","author":"Yaman","year":"2001","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0305-0548(03)00114-X_BIB7","first-page":"47","article-title":"A new shortest paths ranking algorithm","volume":"20","author":"Martins","year":"2000","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"issue":"2","key":"10.1016\/S0305-0548(03)00114-X_BIB8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB9","series-title":"Network flows: theory, algorithms and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(03)00114-X_BIB10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"Note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480300114X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480300114X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T11:51:06Z","timestamp":1553169066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480300114X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S030505480300114X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00114-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}