Pages that link to "Item:Q2828194"
From MaRDI portal
The following pages link to Efficient computation of shortest paths in time-dependent multi-modal networks (Q2828194):
Displaying 13 items.
- Distributed approach for solving time-dependent problems in multimodal transport networks (Q606185) (← links)
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays (Q1582033) (← links)
- Optimization and sustainable development (Q2355714) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- Efficient computation of shortest paths in time-dependent multi-modal networks (Q2828194) (← links)
- User-constrained multimodal route planning (Q2828200) (← links)
- Time dependent multiobjective best path for multimodal urban routing (Q2883602) (← links)
- UniALT for regular language contrained shortest paths on a multi-modal transportation network (Q2917259) (← links)
- Engineering time-dependent many-to-many shortest paths computation (Q2917289) (← links)
- (Q4356887) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
- Theory and Applications of Models of Computation (Q5898875) (← links)
- Routing in multimodal transportation networks with non-scheduled lines (Q6577780) (← links)