Solvingk-shortest and constrained shortest path problems efficiently
- 1 December 1989
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 20 (1) , 249-282
- https://doi.org/10.1007/bf02216932
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computingk-shortest path lengths in euclidean networksNetworks, 1987
- Shortest paths in euclidean graphsAlgorithmica, 1986
- Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseauDiscrete Applied Mathematics, 1986
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- Shortest paths with euclidean distances: An explanatory modelNetworks, 1978