Pages that link to "Item:Q2390996"
From MaRDI portal
The following pages link to A unified exact method for solving different classes of vehicle routing problems (Q2390996):
Displaying 12 items.
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- (Q5120561) (← links)
- A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
- Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types (Q5270509) (← links)
- Decision Support System for the Multi-depot Vehicle Routing Problem (Q5356968) (← links)
- Simple heuristics for the multi-period fleet size and mix vehicle routing problem (Q5879646) (← links)
- Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem (Q6151180) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)