Pages that link to "Item:Q2436645"
From MaRDI portal
The following pages link to Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645):
Displaying 11 items.
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling (Q2917286) (← links)
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs (Q2945178) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
