Pages that link to "Item:Q2046271"
From MaRDI portal
The following pages link to Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271):
Displaying 2 items.
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
