An algorithm for finding the \(k\) quickest paths in a network
From MaRDI portal
Publication:1201855
DOI10.1016/0305-0548(93)90096-2zbMath0773.90081MaRDI QIDQ1201855
Publication date: 17 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(93)90096-2
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Cites Work
- Unnamed Item
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On algorithms for finding the k shortest paths in a network
- Shortest-path algorithms: Taxonomy and annotation
- An efficient algorithm for K shortest simple paths
- Data Structures and Computer Science Techniques in Operations Research
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network