On algorithms for finding the k shortest paths in a network
- 1 September 1979
- Vol. 9 (3), 195-214
- https://doi.org/10.1002/net.3230090303
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Iterative methods for determining the k shortest paths in a networkNetworks, 1976
- More on k th shortest pathsCommunications of the ACM, 1975
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- On computing sets of shortest paths in a graphCommunications of the ACM, 1974
- A Note on an Algebra for the k Best Routes in a NetworkIMA Journal of Applied Mathematics, 1973
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Solutions of the kth best route through a network — A reviewJournal of Mathematical Analysis and Applications, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959