Pages that link to "Item:Q2892160"
From MaRDI portal
The following pages link to Bidirectional A* search on time-dependent road networks (Q2892160):
Displayed 12 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Scalable computational techniques for centrality metrics on temporally detailed social network (Q1688418) (← links)
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network (Q1717836) (← 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)
- (Q5240197) (← links)
- Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind (Q5240227) (← links)
- Space-efficient, fast and exact routing in time-dependent road networks (Q5874554) (← links)
- The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)