{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T18:15:19Z","timestamp":1772388919775,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90039-a","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"153-161","source":"Crossref","is-referenced-by-count":203,"title":["The quickest path problem"],"prefix":"10.1016","volume":"17","author":[{"given":"Y.L.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.H.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90039-A_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":"Computers Opns Res."},{"key":"10.1016\/0305-0548(90)90039-A_BIB2","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 Opns Res."},{"key":"10.1016\/0305-0548(90)90039-A_BIB3","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(90)90039-A_BIB4","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(90)90039-A_BIB5","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(90)90039-A_BIB6","first-page":"4","article-title":"Combinatorial Algorithms","author":"Hu","year":"1982"},{"key":"10.1016\/0305-0548(90)90039-A_BIB7","first-page":"596","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. Am. C. M."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090039A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090039A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:59:47Z","timestamp":1552913987000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489090039A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["030505489090039A"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90039-a","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}