An Appraisal of Some Shortest-Path Algorithms
From MaRDI portal
Publication:5558804
Recommendations
Cited in
(only showing first 100 items - show all)- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- Dijkstra's shortest-path algorithm in a network with variable weight matrices
- Routing algorithms with range restriction in sparse supply networks
- A computational study of efficient shortest path algorithms
- Heuristically guided search and chromosome matching
- Routing with nonlinear multiattribute cost functions
- Shortest paths in stochastic networks with correlated link costs
- On the shortest path problem with negative cost cycles
- Shortest path problem with multiple shortest paths
- Dynamic shortest paths minimizing travel times and costs
- The DT-polynomial approach to discrete time-varying network flow problems
- Space-efficient, fast and exact routing in time-dependent road networks
- Construction of simple path graphs in transport networks. I: General solutions and examples
- Parallel Algorithms for Network Routing Problems and Recurrences
- Arriving on time
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Program realization of shortest path algorithms in transportation MIS
- Energy-optimal routes for battery electric vehicles
- scientific article; zbMATH DE number 1472109 (Why is no real title available?)
- Computational experience with a group theoretic integer programming algorithm
- Shortest and longest path problems
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- A computational improvement for a shortest paths ranking algorithm
- Paths and trails in edge-colored weighted graphs
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- A parallel shortest path algorithm
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- scientific article; zbMATH DE number 3952519 (Why is no real title available?)
- Shortest paths in piecewise continuous time-dependent networks
- Shortest path algorithm confined to conditions in grid data model
- Development and implementation of algorithms for vehicle routing during a no-notice evacuation
- Reliability in public transit networks considering backup itineraries
- An axiomatic approach to time-dependent shortest path oracles
- Generating price-effective intermodal routes
- Shortest-path algorithms: Taxonomy and annotation
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
- scientific article; zbMATH DE number 4185423 (Why is no real title available?)
- Finding the shortest path in stochastic networks
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
- A GRASP and path relinking heuristic for rural road network development
- Optimal routing for maximizing the travel time reliability
- Robust shortest path planning and semicontractive dynamic programming
- Some problems in discrete optimization
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- Estimation of Travel Times in Multiple Mode Systems†
- Models and algorithm for stochastic shortest path problem
- On computing Pareto optimal paths in weighted time-dependent networks
- Personnel assignment by multiobjective programming
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- New algorithms for multi objective shortest path problem.
- Continuous-time shortest path problems with stopping and starting costs
- A generalized permanent label setting algorithm for the shortest path between specified nodes
- scientific article; zbMATH DE number 4066938 (Why is no real title available?)
- Routing of a hazmat truck in the presence of weather systems
- Auction algorithms for network flow problems: A tutorial introduction
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Distributed shortest-path protocols for time-dependent networks
- Shortest path algorithms for functional environments
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
- scientific article; zbMATH DE number 1791938 (Why is no real title available?)
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- Computing the nxm shortest path efficiently
- scientific article; zbMATH DE number 1003284 (Why is no real title available?)
- Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots
- Note on ``A new bidirectional algorithm for shortest paths
- Shortest path methods: A unifying approach
- Shortest paths without a map
- A shortest path routing problem with resource allocation
- A new bidirectional search algorithm with shortened postprocessing
- Solvable classes of discrete dynamic programming
- On the complexity of time-dependent shortest paths
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM
- A bidirectional shortest-path algorithm with good average-case behavior
- Finding shortest path in the presence of barriers: an alternate approach
- Efficient modeling of travel in networks with time-varying link speeds
- An algorithm for then×n optimum assignment problem
- Intelligent transportation systems -- Enabling technologies
- On using dynamic programming for time warping in pattern recognition
- Efficiently listing bounded length \(st\)-paths
- Shortest route with time dependent length of edges and limited delay possibilities in nodes
- Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
- Shortest path problem with uncertain arc lengths
- The multiple shortest path problem with path deconfliction
- On a negative-equivalency theorem in associative optimal path problems
- The first \(K\) shortest unique-arc walks in a traffic-light network
- A weakly coupled model of differential equations for thief tracking
- Heuristic estimates in shortest path algorithms
- On the complexity of testing a graph for n-cube
- Bicriteria shortest path in networks of queues
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- The impact of time aggregation and travel time models on time-dependent routing solutions
- Shortest path algorithms using dynamic breadth‐first search
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- A new algorithm to find the shortest paths between all pairs of nodes
- On the connectivity of a network
- Data-driven approaches for emissions-minimized paths in urban areas
- Fast paths in large-scale dynamic road networks
- An algorithm for finding the \(k\) quickest paths in a network
- Time complexity of a path formulated optimal routing algorithm (second printing)
This page was built for publication: An Appraisal of Some Shortest-Path Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558804)
