Pages that link to "Item:Q1793543"
From MaRDI portal
The following pages link to Least expected time paths in stochastic schedule-based transit networks (Q1793543):
Displaying 7 items.
- Trip-based path algorithms using the transit network hierarchy (Q298925) (← links)
- Properties of expected costs and performance measures in stochastic models of scheduled transport (Q1388938) (← links)
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network (Q1717836) (← links)
- Corrigendum to: ``Least expected time paths in stochastic schedule-based transit networks'' (Q1721083) (← links)
- Finding optimal hyperpaths in large transit networks with realistic headway distributions (Q2629602) (← links)
- Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
- Least expected time paths in stochastic, time-varying transportation networks (Q2783884) (← links)