Pages that link to "Item:Q3133213"

The following pages link to PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$ (Q3133213):

Displaying 12 items.

• Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
• Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
• 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)
• Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641) (← links)
• Multi-shuttle crane scheduling in automated storage and retrieval systems (Q2672114) (← links)
• A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
• A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
• Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
• Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)