{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T01:38:29Z","timestamp":1781141909978,"version":"3.54.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0020-0190(93)90057-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"125-128","source":"Crossref","is-referenced-by-count":94,"title":["On the quickest path problem"],"prefix":"10.1016","volume":"46","author":[{"given":"Gen-Huey","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yung-Chen","family":"Hung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90057-G_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0305-0548(88)90031-7","article-title":"Minimum cost-reliability ratio problem","volume":"16","author":"Ahuja","year":"1988","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0020-0190(93)90057-G_BIB2","first-page":"63","article-title":"Routing and scheduling of vehicles and crews","volume":"10","author":"Bodin","year":"1982","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0020-0190(93)90057-G_BIB3","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\/0020-0190(93)90057-G_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","article-title":"Shortest-path algorithms: taxonomy and annotation","volume":"14","author":"Deo","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90057-G_BIB5","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. ACM"},{"key":"10.1016\/0020-0190(93)90057-G_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.3230070204","article-title":"Deterministic network optimization: a bibliography","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90057-G_BIB7","author":"Horowitz","year":"1978"},{"key":"10.1016\/0020-0190(93)90057-G_BIB8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constrains","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90057-G_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.1975.5.2.129","article-title":"Bibliography on algorithms for shortest path, shortest spanning tree, and related circuit routing problems","volume":"5","author":"Pierce","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90057-G_BIB10","doi-asserted-by":"crossref","unstructured":"J.B. Rosen and G.L. Xue, Sequential and distributed algorithms for the all pairs quickest path problem, Lecture Notes in Computer Science 497 (Springer, Berlin) 471\u2013473.","DOI":"10.1007\/3-540-54029-6_196"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390057G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390057G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:39:10Z","timestamp":1580899150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390057G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["002001909390057G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90057-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}