{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:51:00Z","timestamp":1767649860009},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":[[1997,5]]},"DOI":"10.1016\/s0167-6377(97)00008-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:03:44Z","timestamp":1027641824000},"page":"195-198","source":"Crossref","is-referenced-by-count":101,"title":["An algorithm for the quickest path problem"],"prefix":"10.1016","volume":"20","author":[{"given":"Ernesto de Queir\u00f3s Vieira","family":"Martins","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Luis Esteves","family":"dos Santos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00008-4_bib1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00008-4_bib2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-6377(97)00008-4_bib3","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(97)00008-4_bib4","series-title":"Multiple Criteria Decision Making: Theory and Applications","first-page":"109","article-title":"Bicriterion path problems","volume":"Vol. 177","author":"Hansen","year":"1980"},{"key":"10.1016\/S0167-6377(97)00008-4_bib5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(84)90011-0","article-title":"On a special class of bicriterion path problems","volume":"17","author":"Martins","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00008-4_bib6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","article-title":"On the fastest route for convoy-type traffic in flowrate-constrained networks","volume":"10","author":"Moore","year":"1976","journal-title":"Transport. Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000084?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000084?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T09:55:50Z","timestamp":1555494950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0167637797000084"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00008-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}