{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:05:28Z","timestamp":1778601928672,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":[[1994,2]]},"DOI":"10.1016\/0305-0548(94)90045-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"113-118","source":"Crossref","is-referenced-by-count":91,"title":["Algorithms for the constrained quickest path problem and the enumeration of quickest paths"],"prefix":"10.1016","volume":"21","author":[{"given":"Chen","family":"Gen-Huey","sequence":"first","affiliation":[]},{"given":"Hung","family":"Yung-Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90045-0_BIB1","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\/0305-0548(94)90045-0_BIB2","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\/0305-0548(94)90045-0_BIB3","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":"Computers ops Res."},{"key":"10.1016\/0305-0548(94)90045-0_BIB4","first-page":"63","article-title":"Routing and scheduling of vehicles and crews. The state of the art","volume":"10","author":"Bodin","year":"1982","journal-title":"Computers ops Res."},{"key":"10.1016\/0305-0548(94)90045-0_BIB5","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibronacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(94)90045-0_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\/0305-0548(94)90045-0_BIB7","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":"1989","journal-title":"Computers ops Res."},{"key":"10.1016\/0305-0548(94)90045-0_BIB8","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithm for the quickest path problem and the enumeration of quickest paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Computers ops Res."},{"key":"10.1016\/0305-0548(94)90045-0_BIB9","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/0167-8191(92)90048-C","article-title":"Distributed algorithms for the quickest path problem","volume":"18","author":"Hung","year":"1992","journal-title":"Parallel Computing"},{"key":"10.1016\/0305-0548(94)90045-0_BIB10","first-page":"44","article-title":"On the quickest path problem","author":"Hung","year":"1991"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:26:11Z","timestamp":1552929971000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0305054894900450"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90045-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}