Shortest paths on dynamic graphs
From MaRDI portal
Publication:3638853
DOI10.1111/j.1475-3995.2008.00649.xzbMath1188.90267OpenAlexW2166460706MaRDI QIDQ3638853
Giacomo Nannicini, Leo Liberti
Publication date: 28 October 2009
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00649.x
Related Items (6)
Bidirectional A* search on time-dependent road networks ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Periodic paths on nonautonomous graphs ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Equilibrium distributions of discrete non-autonomous graphs ⋮ Optimization and sustainable development
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Shortest paths in Euclidean graphs
- A new algorithm for reoptimizing shortest paths when the arc costs change
- The shortest route through a network with time-dependent internodal transit times
- A generalized permanent label setting algorithm for the shortest path between specified nodes
- Speeding Up Dynamic Shortest-Path Algorithms
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Reoptimization procedures in shortest path problem
- Etude Et Extension D’Un Algorithme De Murghland
- Dynamic shortest paths minimizing travel times and costs
- An Appraisal of Some Shortest-Path Algorithms
- Some New Techniques in Transportation Planning†
- A Dual Shortest Path Algorithm
This page was built for publication: Shortest paths on dynamic graphs
