An algorithm for the ranking of shortest paths
From MaRDI portal
Publication:1309941
DOI10.1016/0377-2217(93)90095-5zbMath0782.90091MaRDI QIDQ1309941
José Augusto Azevedo, Maria Emília O. Santos Costa, Joaquim João E. R. Silvestre Madeira, Ernesto Q. Vieira Martins
Publication date: 28 February 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90095-5
90C35: Programming involving graphs or networks
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Efficient algorithms to find optimal paths in a public transportation network, Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa, A bicriterion approach for routing problems in multimedia networks, A multi-modal approach to the location of a rapid transit line, A computational improvement for a shortest paths ranking algorithm, Solving some lexicographic multi-objective combinatorial problems, Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Shortest route computation in distributed systems, Finding \(K\) shortest looping paths in a traffic-light network, Multiobjective routing problems, Shortest path problems with partial information: Models and algorithms for detecting dominance, The fastest itinerary in time-dependent decentralized travel information systems, Finding \(K\) shortest looping paths with waiting time in a time--window network
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for ranking paths that may contain cycles
- A bicriterion shortest path algorithm
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A note on the constrained shortest-path problem
- Shortest-path algorithms: Taxonomy and annotation
- Shortest path methods: A unifying approach
- Shortest Path and Network Flow Algorithms
- Iterative methods for determining the k shortest paths in a network
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- The constrained shortest path problem
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
