The following pages link to (Q5417633):
Displaying 9 items.
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
