Finding the k quickest simple paths in a network
- 1 April 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (2) , 89-92
- https://doi.org/10.1016/0020-0190(94)00008-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An algorithm for finding the k quickest paths in a networkComputers & Operations Research, 1993
- 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
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971