On the complexity of time-dependent shortest paths
From MaRDI portal
(Redirected from Publication:476455)
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3702681 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- scientific article; zbMATH DE number 6297748 (Why is no real title available?)
- scientific article; zbMATH DE number 6472653 (Why is no real title available?)
- Algorithms – ESA 2004
- An Analysis of Stochastic Shortest Path Problems
- An Appraisal of Some Shortest-Path Algorithms
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Faster parametric shortest path and minimum‐balance algorithms
- Introduction to algorithms
- Parametric Problems on Graphs of Bounded Tree-Width
- Parametric shortest path algorithms with an application to cyclic staffing
- Shortest paths in time-dependent FIFO networks
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Stochastic Shortest Paths Via Quasi-convex Maximization
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- The weighted region problem
- Time depending shortest-path problems with applications to railway networks
- Time-dependent route planning
- Time-varying shortest path problems with constraints
- Worst-case update times for fully-dynamic all-pairs shortest paths
Cited in
(26)- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
- The piecewise constant/linear solution for dynamic user equilibrium
- Engineering time-dependent many-to-many shortest paths computation
- Temporal matching on geometric graph data
- Distributed shortest-path protocols for time-dependent networks
- Perspectives on integer programming for time-dependent models
- Shortest paths in time-dependent FIFO networks
- Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary
- An axiomatic approach to time-dependent shortest path oracles
- Computation of the optimal value function in time-dependent networks
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Shortest Journeys in Directed Temporal Graphs
- Shortest path with acceleration constraints: complexity and approximation algorithms
- Concerning the time bounds of existing shortest watchman route algorithms
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- New complexity results for time-constrained dynamical optimal path problems
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- Energy-optimal routes for battery electric vehicles
- Bi-directional search for robust routes in time-dependent bi-criteria road networks
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
- TSP race: minimizing completion time in time-sensitive applications
- Time-dependent shortest path problems with penalties and limits on waiting
- On computing Pareto optimal paths in weighted time-dependent networks
- Scheduling activities with time-dependent durations and resource consumptions
- Improved approximation for time-dependent shortest paths
- On the complexity of time-dependent shortest paths
This page was built for publication: On the complexity of time-dependent shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476455)
