Pages that link to "Item:Q5918417"
From MaRDI portal
The following pages link to Improving the approximation ratio for capacitated vehicle routing (Q5918417):
Displaying 7 items.
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Improved approximation algorithms for multidepot capacitated vehicle routing (Q6591657) (← links)
- Airports and railways with unsplittable demand (Q6663529) (← links)
