An algorithm for the ranking of shortest paths
Authors:
- Joséaugusto AzevedoJAJoséaugusto Azevedo
- Maria Emília O. Santos CostaMCMaria Emília O. Santos Costa
- Joaquim João E.R. Silvestre MadeiraJMJoaquim João E.R. Silvestre Madeira
- Ernesto Q. Vieira MartinsEMErnesto Q. Vieira Martins
- 1 August 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 69 (1) , 97-106
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Shortest path methods: A unifying approach1986
- An algorithm for ranking paths that may contain cyclesEuropean Journal of Operational Research, 1984
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- A bicriterion shortest path algorithmEuropean Journal of Operational Research, 1982
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Shortest Path and Network Flow Algorithms1979
- The constrained shortest path problemNaval Research Logistics Quarterly, 1978
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969