Pages that link to "Item:Q476455"
From MaRDI portal
The following pages link to On the complexity of time-dependent shortest paths (Q476455):
Displayed 15 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← links)
- Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary (Q2174053) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (Q5085472) (← links)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009) (← links)
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles (Q5111696) (← links)
- (Q5240197) (← links)
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)
- The piecewise constant/linear solution for dynamic user equilibrium (Q6147912) (← links)