{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:25:49Z","timestamp":1773087949971,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"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,3]]},"DOI":"10.1016\/s0305-0548(02)00197-1","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"383-395","source":"Crossref","is-referenced-by-count":11,"title":["The quickest path problem with interval lead times"],"prefix":"10.1016","volume":"31","author":[{"given":"Herminia I.","family":"Calvete","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00197-1_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 & Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_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(02)00197-1_BIB3","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\/S0305-0548(02)00197-1_BIB4","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(02)00197-1_BIB5","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 & Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(93)90096-2","article-title":"An algorithm for finding the k quickest paths in a network","volume":"20","author":"Chen","year":"1993","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB7","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 & Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB8","series-title":"Actes des IV\u00e8mes Journ\u00e9es Zaragoza-Pau de Math\u00e9matiques Appliqu\u00e9es","first-page":"129","article-title":"Un problema de planificaci\u00f3n de la producci\u00f3n: aplicaci\u00f3n del problema de la ruta m\u00e1s r\u00e1pida","author":"Calvete","year":"1997"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1057\/palgrave.jors.2600891","article-title":"Linear programming with interval coefficients","volume":"51","author":"Chinneck","year":"2000","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB10","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1287\/opre.24.4.783","article-title":"Exact solutions of inexact linear programs","volume":"24","author":"Falk","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0377-2217(90)90375-L","article-title":"Multiobjective programming in optimization of the interval objective function","volume":"48","author":"Ishibuchi","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/moor.6.3.333","article-title":"Algorithms for linear programming problems with interval objective functions","volume":"6","author":"Steuer","year":"1981","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB13","series-title":"Introduction to interval computations","author":"Alefeld","year":"1983"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB14","series-title":"Interval analysis","author":"Moore","year":"1966"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB15","series-title":"Multiple criteria optimization: theory, computation and application","author":"Steuer","year":"1986"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB16","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/0377-2217(95)00055-0","article-title":"Multiobjective programming in optimization of interval objective functions\u2014a generalized approach","volume":"94","author":"Chanas","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","article-title":"An empirical investigation of some bicriterion shortest path algorithms","volume":"43","author":"Brumbaugh-Smith","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB18","series-title":"Multiple criteria decision making: theory and applications","first-page":"109","article-title":"Bicriterion path problems","volume":"vol. 177","author":"Hansen","year":"1980"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB19","unstructured":"Serafini P. Some considerations about computational complexity for multiobjective combinatorial problems, in: Jahn J, Krabs W, editors. Recent advances and historical development of vector optimization. Lecture Notes in Economics and Mathematical Systems, vol. 294. Berlin:Springer, 1986. p. 22\u201332."},{"key":"10.1016\/S0305-0548(02)00197-1_BIB20","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","article-title":"A label correcting approach for solving bicriterion shortest-path problems","volume":"27","author":"Skriver","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00197-1_BIB21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple-objective shortest-path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001971?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001971?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:52:21Z","timestamp":1553673141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0305054802001971"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00197-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}