Pages that link to "Item:Q3467845"
From MaRDI portal
The following pages link to Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845):
Displaying 7 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)
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641) (← 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)
- (Q5417633) (← links)