Pages that link to "Item:Q2581622"
From MaRDI portal
The following pages link to Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622):
Displaying 9 items.
- Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network (Q948645) (← links)
- Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
- Dynamic journeying under uncertainty (Q2253524) (← links)
- The fastest itinerary in time-dependent decentralized travel information systems (Q2369978) (← links)
- The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
- Time analysis for planning a path in a time-window network (Q4661089) (← links)
- Finding theKth shortest path in a time-schedule network (Q4680459) (← links)
- An efficient exact approach for the constrained shortest path tour problem (Q4972542) (← links)
- Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind (Q5240227) (← links)
