An algorithm for the quickest path problem

Operations Research Letters

Volumn 20, Issue 4, 1997, Pages 195-198

  Martins, Ernesto de Queirós Vieira ^a   Dos Santos, José Luís Esteves ^a  

^a NONE

Author keywords

Network; Nondominated path; Path capacity; Path distance; Quickest path

Indexed keywords

EID: 0000652817     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00008-4     Document Type: Article

References (6)

1. Y.L. Chen and Y.H. Chin, "The quickest path problem", Comput. Oper. Res. 17, 153-161 (1990).
2. E. Dijkstra, "A note on two problems in connection with graphs", Numer. Math. 1, 395-412 (1959).
3. M. L. Fredman and R.E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms", J. Assoc. Comput. Mach. 34, 596-615 (1987).
4. P. Hansen, "Bicriterion path problems", in: G. Fandel and T. Gal (eds.), Multiple Criteria Decision Making: Theory and Applications, Lectures Notes in Economics and Mathematical Systems, Vol. 177, Springer, Heidelberg, 1980, pp. 109-127.
5. E.Q.V. Martins, "On a special class of bicriterion path problems", Eur. J. Oper. Res. 17, 85-94 (1984).
6. M.H. Moore, "On the fastest route for convoy-type traffic in flowrate-constrained networks", Transport. Sci. 10, 113-124 (1976).