Pages that link to "Item:Q4408702"
From MaRDI portal
The following pages link to Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (Q4408702):
Displaying 12 items.
- Time-dependent routing problems: a review (Q342083) (← links)
- Reachability for airline networks: fast algorithm for shortest path problem with time windows (Q1630997) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- A note on the minimum instantaneous cost path of the dynamic traffic assignment problem (Q1908281) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (Q2514743) (← links)
- Minimum work paths in elevated networks (Q3528153) (← links)
- Dynamic shortest paths minimizing travel times and costs (Q4419276) (← links)
- Modular circulation and applications to traffic management (Q5919619) (← links)
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)
