Algorithms for the quickest path problem and the enumeration of quickest paths

DOI10.1016/0305-0548(91)90063-WzbMath0747.90104MaRDI QIDQ1184451

Guoliang Xue, J. Ben Rosen, Shangzhi Sun

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

minimum time; routing path; input network; single pair quickest path problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90B18: Communication networks in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

The multichannel quickest-path problem, An algorithm for finding the \(k\) quickest paths in a network, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Finding the \(k\) quickest simple paths in a network, On the sum-max bicriterion path problem., The quickest path problem with batch constraints., The quickest path problem with interval lead times, Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network, Probabilistic quickest path algorithm, A label-setting algorithm for finding a quickest path, An algorithm for ranking quickest simple paths, Multiobjective routing problems, The all-pairs quickest path problem, Fast data transmission and maximal dynamic flow., The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets, The quickest flow problem, Finding the k Shortest Paths

Cites Work

• The quickest path problem
• Minimum cost-reliability ratio path problem
• Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
• Fibonacci heaps and their uses in improved network optimization algorithms