Computing k-shortest path for nuclear spent fuel highway transportation
- 5 July 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 53 (1), 64-80
- https://doi.org/10.1016/0377-2217(91)90093-b
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computingk-shortest path lengths in euclidean networksNetworks, 1987
- Shortest paths in euclidean graphsAlgorithmica, 1986
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- Shortest‐path methods: Complexity, interrelations and new propositionsNetworks, 1984
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- Algorithm 562: Shortest Path Lengths [H]ACM Transactions on Mathematical Software, 1980
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- Shortest paths with euclidean distances: An explanatory modelNetworks, 1978
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977