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):
Displayed 4 items.
- 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)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
