Computation of the optimal value function in time-dependent networks
DOI10.1002/net.21501zbMath1338.90081OpenAlexW1971343470MaRDI QIDQ2811299
Sebastian Kluge, Martin Brokate, Konrad Reif
Publication date: 10 June 2016
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21501
dynamic programmingapproximation algorithmanalysis of algorithmsshortest path problemdeterministic network models
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Continuous-time shortest path problems with stopping and starting costs
- A finite-time algorithm for shortest path problems with time-varying costs
- Shortest paths in a network with time-dependent flow speeds
- On a routing problem
- New complexity results for time-constrained dynamical optimal path problems
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Engineering Route Planning Algorithms
- Time-Dependent Route Planning
- Piecewise-linear programming: The compact (CPLP) algorithm
- Generalized best-first search strategies and the optimality of A*
- Minimum weight paths in time-dependent networks
- Continuous-Time Shortest Path Problems and Linear Programming
- Multiobjective A*
- Time-varying shortest path problems with constraints
- Dynamic shortest paths minimizing travel times and costs
- Consensus and Cooperation in Networked Multi-Agent Systems
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- A set oriented approach to global optimal control
This page was built for publication: Computation of the optimal value function in time-dependent networks
