A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
Algorithmica2014Vol. 73(1), pp. 115–142
Citations Over TimeTop 1% of 2014 papers
Related Papers
- → The Solutions to Traveling Salesman Problem(2023)2 cited
- Dynasearch Algorithms for Solving Time Dependent Traveling Salesman Problem(2008)
- → A Natural Approach to Solving the Traveling Salesman Problem(2023)1 cited
- Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem(2009)
- Real-Life Traveling-Salesman Problem(2005)