Pages that link to "Item:Q2185641"
From MaRDI portal
The following pages link to Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641):
Displaying 7 items.
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension (Q2243777) (← links)
- An optimization algorithm for a capacitated vehicle routing problem with time windows (Q2363743) (← links)
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows (Q4596452) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- (Q5417633) (← links)