Pages that link to "Item:Q2268926"
From MaRDI portal
The following pages link to Fast paths in large-scale dynamic road networks (Q2268926):
Displaying 9 items.
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Optimization and sustainable development (Q2355714) (← links)
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (Q2664011) (← links)
- Finding Traffic-Aware Fastest Paths in Spatial Networks (Q2847563) (← links)
- Bidirectional \(A^*\) search on time-dependent road networks (Q2892160) (← links)
- Fast Routing in Road Networks with Transit Nodes (Q3101693) (← links)
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems (Q4427339) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
- Ranking One Million Simple Paths in Road Networks (Q5506763) (← links)