An algorithm for finding the k quickest paths in a network
- 1 January 1993
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 20 (1) , 59-65
- https://doi.org/10.1016/0305-0548(93)90096-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the quickest path problemPublished by Springer Nature ,1991
- Algorithms for the quickest path problem and the enumeration of quickest pathsComputers & Operations Research, 1991
- The quickest path problemComputers & Operations Research, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- Data Structures and Computer Science Techniques in Operations ResearchOperations Research, 1978
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969