Iterative methods for determining the k shortest paths in a network
- 1 January 1976
- Vol. 6 (3) , 205-229
- https://doi.org/10.1002/net.3230060303
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Computational experience with an algorithm for finding the k shortest paths in a networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1974
- A Note on an Algebra for the k Best Routes in a NetworkIMA Journal of Applied Mathematics, 1973
- An Algebra for Network Routing ProblemsIMA Journal of Applied Mathematics, 1971
- 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
- Onkth Best PoliciesJournal of the Society for Industrial and Applied Mathematics, 1960