{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T01:55:21Z","timestamp":1770429321951,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1016\/s0305-0548(03)00195-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:09:00Z","timestamp":1062587340000},"page":"2405-2418","source":"Crossref","is-referenced-by-count":64,"title":["A label-setting algorithm for finding a quickest path"],"prefix":"10.1016","volume":"31","author":[{"given":"Chan-Kyoo","family":"Park","sequence":"first","affiliation":[]},{"given":"Sangwook","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Soondal","family":"Park","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00195-3_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":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB2","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":"Transportation Science"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB3","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithms for the quickest path problem and the enumeration of quickest path","volume":"18","author":"Rosen","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","article-title":"An algorithm for the quickest path problem","volume":"20","author":"Martins","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(93)90057-G","article-title":"On the quickest path problem","volume":"46","author":"Chen","year":"1993","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","article-title":"Finding the k quickest simple paths in a network","volume":"50","author":"Chen","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J","article-title":"Transmissions in a network with capacities and delays","volume":"33","author":"Kagaris","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0020-0190(98)00047-7","article-title":"Fast data transmission and maximal dynamic flow","volume":"66","author":"Xue","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB9","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S0305-0548(02)00025-4","article-title":"Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network","volume":"30","author":"Lin","year":"2003","journal-title":"Computers and Operation Research"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB10","series-title":"Combinatorial algorithms","author":"Hu","year":"1982"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB11","series-title":"Networks flows: theory, algorithms and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(03)00195-3_BIB12","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001953?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001953?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:22:39Z","timestamp":1551079359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":12,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S0305054803001953"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00195-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}