An algorithm for the ranking of shortest paths
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3965788 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- 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
- An Appraisal of Some Shortest-Path Algorithms
- An algorithm for ranking paths that may contain cycles
- Finding the K Shortest Loopless Paths in a Network
- Iterative methods for determining the k shortest paths in a network
- Shortest Path and Network Flow Algorithms
- Shortest path methods: A unifying approach
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Shortest-path algorithms: Taxonomy and annotation
- The constrained shortest path problem
Cited in
(33)- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- Considering en-route choices in utility-based route choice modelling
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Interactive in-vehicle guidance through a multihierarchical representation of urban maps
- A computational improvement for a shortest paths ranking algorithm
- A bicriterion approach for routing problems in multimedia networks
- Shortest paths with ordinal weights
- Shortest route computation in distributed systems
- DTA2012 symposium: Combining disaggregate route choice estimation with aggregate calibration of a dynamic traffic assignment model
- Finding the K Shortest Loopless Paths in a Network
- Exploring trust region method for the solution of logit-based stochastic user equilibrium problem
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A new implementation of Yen's ranking loopless paths algorithm
- Congestion avoiding heuristic path generation for the proactive route guidance
- Improving truncated Newton method for the logit-based stochastic user equilibrium problem
- The fastest itinerary in time-dependent decentralized travel information systems
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem
- Deviation algorithms for ranking shortest paths
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Finding the K shortest paths in a time-schedule network with constraints on arcs
- Multiobjective routing problems
- Efficient algorithms to find optimal paths in a public transportation network
- A multi-modal approach to the location of a rapid transit line
- An algorithm for ranking quickest simple paths
- A new \(O(m+k n \log \overline{d})\) algorithm to find the \(k\) shortest paths in acyclic digraphs
- Finding \(K\) shortest looping paths in a traffic-light network
- Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints
- An algorithm for ranking paths that may contain cycles
- Solving some lexicographic multi-objective combinatorial problems
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Speeding up Martins' algorithm for multiple objective shortest path problems
This page was built for publication: An algorithm for the ranking of shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309941)
