Pages that link to "Item:Q3069731"
From MaRDI portal
The following pages link to PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k (Q3069731):
Displaying 10 items.
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- 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)
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension (Q2243777) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- A PTAS for Capacitated Vehicle Routing on Trees (Q6075752) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
