scientific article; zbMATH DE number 7121923
From MaRDI portal
Publication:5240197
DOI10.4230/OASIcs.ATMOS.2015.82zbMath1432.90021MaRDI QIDQ5240197
Matúš Mihalák, Sandro Montanari
Publication date: 24 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance oracles for time-dependent networks
- On the complexity of time-dependent shortest paths
- Time-dependent SHARC-routing
- On a multicriteria shortest path problem
- On the robust shortest path problem.
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Algorithms for time-dependent bicriteria shortest path problems
- Time dependent multiobjective best path for multimodal urban routing
- Bidirectional A* search on time-dependent road networks
- Time-Dependent Route Planning with Generalized Objective Functions
- Robust optimization in the presence of uncertainty
- Finding the k shortest simple paths
- Minimum time-dependent travel times with contraction hierarchies
- Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
- Route Planning with Flexible Objective Functions
This page was built for publication:
