{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:21:28Z","timestamp":1648592488945},"reference-count":8,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":["Computer Communications"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0140-3664(00)00158-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:34:39Z","timestamp":1027650879000},"page":"1064-1068","source":"Crossref","is-referenced-by-count":10,"title":["On update algorithms for quickest paths"],"prefix":"10.1016","volume":"23","author":[{"given":"Y.C","family":"Bang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.S.V","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.G","family":"Batsell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(00)00158-4_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"issue":"2","key":"10.1016\/S0140-3664(00)00158-4_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","article-title":"Algorithms for the constrained quickest path problem and the enumeration of quickest paths","volume":"21","author":"Chen","year":"1994","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/S0140-3664(00)00158-4_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":"Computers and Operations Research"},{"key":"10.1016\/S0140-3664(00)00158-4_BIB4","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\/S0140-3664(00)00158-4_BIB5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","article-title":"An algorithms for the quickest path problem","volume":"20","author":"Martins","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0140-3664(00)00158-4_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","article-title":"On the fastest routes for convoy-type traffic in flowrate-constrained networks","volume":"10","author":"Mollenauer","year":"1976","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/S0140-3664(00)00158-4_BIB7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/4234.625044","article-title":"Algorithm for minimum end-to-end delay paths","volume":"1","author":"Rao","year":"1997","journal-title":"IEEE Communications Letters"},{"issue":"6","key":"10.1016\/S0140-3664(00)00158-4_BIB8","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 paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Computers and Operations Research"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T12:53:41Z","timestamp":1555246421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366400001584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":8,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0140366400001584"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(00)00158-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}