Pages that link to "Item:Q494936"
From MaRDI portal
The following pages link to A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936):
Displaying 13 items.
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← 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)
- Makespan trade-offs for visiting triangle edges (extended abstract) (Q2115869) (← 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)
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← 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)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
