{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T19:42:21Z","timestamp":1770147741812,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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,3]]},"DOI":"10.1016\/0305-0548(94)90096-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"353-358","source":"Crossref","is-referenced-by-count":2,"title":["The single most vital arc in the most economical path problem\u2014A parametric analysis"],"prefix":"10.1016","volume":"21","author":[{"given":"Lin","family":"Kao-Ch\u00eang","sequence":"first","affiliation":[]},{"given":"Chern","family":"Maw-Sheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90096-5_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","article-title":"Finding the most vital arcs in a network","volume":"8","author":"Ball","year":"1989","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90096-5_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","article-title":"Most vital links and nodes in weighted networks","volume":"1","author":"Corley","year":"1982","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90096-5_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","article-title":"The k most vital arcs in the shortest path problem","volume":"8","author":"Malik","year":"1989","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90096-5_BIB4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0167-6377(90)90074-F","article-title":"Erratum: the k most vital arcs in the shortest path problem","volume":"9","author":"Malik","year":"1990","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90096-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0165-0114(93)90508-F","article-title":"The fuzzy shortest path problem and its most vital arcs","volume":"58","author":"Lin","year":"1993","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/0305-0548(94)90096-5_BIB6","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.38.4.624","article-title":"Efficient shortest path simplex algorithms","volume":"38","author":"Goldfarb","year":"1990","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90096-5_BIB7","series-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"1990"},{"key":"10.1016\/0305-0548(94)90096-5_BIB8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90096-5_BIB9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01581642","article-title":"Computational complexity of parametric linear programming","volume":"19","author":"Murty","year":"1980","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90096-5_BIB10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","article-title":"Parametric shortest path algorithms with an application to cyclic staffing","volume":"3","author":"Karp","year":"1981","journal-title":"Discr. appl. Maths"},{"key":"10.1016\/0305-0548(94)90096-5_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","article-title":"Faster parametric shortest path and minimum-balance algorithms","volume":"21","author":"Young","year":"1991","journal-title":"Network"},{"key":"10.1016\/0305-0548(94)90096-5_BIB12","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 Ops Res."},{"key":"10.1016\/0305-0548(94)90096-5_BIB13","series-title":"Combinatorial Algorithms","author":"Hu","year":"1982"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900965?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900965?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:26:13Z","timestamp":1552915573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0305054894900965"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90096-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}