The shortest path problem on large-scale real-road networks
From MaRDI portal
Publication:3418206
Recommendations
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
- Shortest path calculation in large road networks
- Microcomputer-based algorithms for large scale shortest path problems
- A memetic algorithm to schedule planned maintenance for the national grid
- Engineering Highway Hierarchies
Cites work
- scientific article; zbMATH DE number 1003284 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 46980 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- A Shortest Path Algorithm for Edge-Sparse Graphs
- Threshold assignment algorithm
Cited in
(37)- Algorithm engineering for route planning: an update
- An extension of labeling techniques for finding shortest path trees
- A new bidirectional search algorithm with shortened postprocessing
- scientific article; zbMATH DE number 1947387 (Why is no real title available?)
- Dynamic graph generation for the shortest path problem in time expanded networks
- Microcomputer-based algorithms for large scale shortest path problems
- A Shortest Path Algorithm Based on Limited Search Heuristics
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Heuristic estimates in shortest path algorithms
- An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
- scientific article; zbMATH DE number 1528594 (Why is no real title available?)
- The searchlight problem for road networks
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
- An efficient algorithm for solving the median problem on real road networks
- Estimation and determination of shortest path length in a road network with obstacles
- Real-world applications of shortest path algorithms
- Routing algorithms with range restriction in sparse supply networks
- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
- Rule based shortest path query algorithm
- The Shortcut Problem – Complexity and Approximation
- scientific article; zbMATH DE number 1983277 (Why is no real title available?)
- Combining speed-up techniques for shortest-path computations
- Label-correcting shortest path algorithms revisisted
- A memetic algorithm to schedule planned maintenance for the national grid
- scientific article; zbMATH DE number 3880462 (Why is no real title available?)
- Scalable exact visualization of isocontours in road networks via minimum-link paths
- Computing the nxm shortest path efficiently
- Large margin shortest path routing
- Acceleration of the A\(^*\)-algorithm for the shortest path problem in digital road maps
- Theory and Applications of Models of Computation
- Fast paths in large-scale dynamic road networks
- Geometric containers for efficient shortest-path computation
- scientific article; zbMATH DE number 5260074 (Why is no real title available?)
- On a technique for finding running tracks of specific length in a road network
- Ranking One Million Simple Paths in Road Networks
- Computing the shortest path: \(A^\ast\) search meets graph theory
This page was built for publication: The shortest path problem on large-scale real-road networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418206)
