Pages that link to "Item:Q1761096"
From MaRDI portal
The following pages link to Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096):
Displaying 15 items.
- Trip-based path algorithms using the transit network hierarchy (Q298925) (← links)
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs (Q336675) (← links)
- Stochastic user equilibrium assignment in schedule-based transit networks with capacity constraints (Q714291) (← links)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
- Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network (Q1717836) (← links)
- Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
- Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
- Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms (Q1930787) (← links)
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction (Q2027056) (← links)
- Dynamic threshold P systems with delay on synapses for shortest path problems (Q2152438) (← links)
- The first <i>K</i> minimum cost paths in a time-schedule network (Q4658384) (← links)
- Finding theKth shortest path in a time-schedule network (Q4680459) (← links)
- Finding the K mean-standard deviation shortest paths under travel time uncertainty (Q6569063) (← links)
- Finding the \(k\) shortest simple paths: time and space trade-offs (Q6579778) (← links)
