On finding dissimilar paths
Top Cited Papers
- 1 March 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 121 (2) , 232-246
- https://doi.org/10.1016/s0377-2217(99)00214-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Modeling of Transport Risk for Hazardous MaterialsOperations Research, 1998
- A Minimax Method for Finding the k Best “Differentiated” PathsGeographical Analysis, 1997
- A comparison of p-dispersion heuristicsComputers & Operations Research, 1994
- Computing k-shortest path for nuclear spent fuel highway transportationEuropean Journal of Operational Research, 1991
- The discrete p-dispersion problemEuropean Journal of Operational Research, 1990
- Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion ProblemsGeographical Analysis, 1987
- Computingk-shortest path lengths in euclidean networksNetworks, 1987
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971