Pages that link to "Item:Q1703462"
From MaRDI portal
The following pages link to Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462):
Displaying 13 items.
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
- A comparison of techniques for solving the fleet size and mix vehicle routing problem (Q800225) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Flexible two-echelon location routing problem (Q1740565) (← links)
- The two-echelon production-routing problem (Q2028880) (← links)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- (Q3372337) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Decision support for the technician routing and scheduling problem (Q6180048) (← links)
- Nested benders decomposition for a deterministic biomass feedstock logistics problem (Q6667706) (← links)
