An algorithm for the quickest path problem

DOI10.1016/S0167-6377(97)00008-4zbMath0881.90124MaRDI QIDQ1362526

Ernesto de Queirós Vieira Martins, José Luís Esteves dos Santos

Publication date: 8 October 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

network; quickest path problem; path capacity; bicriteria path problem; nondominated path; path distance

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90B18: Communication networks in operations research

Related Items

Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa, The determination of the path with minimum-cost norm value, Internet packet routing: application of a \(K\)-quickest path algorithm, Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm, Optimal paths in bi-attribute networks with fractional cost functions, Time version of the shortest path problem in a stochastic-flow network, Reliability based assignment in stochastic-flow freight network, Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network, A label-setting algorithm for finding a quickest path, An algorithm for ranking quickest simple paths

Cites Work

• On a special class of bicriterion path problems
• The quickest path problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item