Pages that link to "Item:Q1626744"
From MaRDI portal
The following pages link to A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744):
Displaying 9 items.
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays (Q1582033) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary (Q2174053) (← links)
- An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
- Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs (Q4540047) (← links)
