| References |
Adamaszek, C., Czumaj, A., Lingas, A., (2009) PTAS for k-tour cover problem on the plane for moderately large values of k, , Manuscript 1; Arora, S., Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (1998) J. ACM, 45 (5), pp. 753-782; Asano, T., Katoh, N., Tamaki, H., Tokuyama, T., (1996) Covering points in the plane by k-tours: A polynomial time approximation scheme for fixed k, , IBM Tokyo Research; Caric, T., Gold, H., (2008) Vehicle Routing Problem, , InTech; Christofides, N., Worst-case analysis of a new heuristic for the traveling salesman problem (1975) Symposium on New Directions and Recent Results in Algorithms and Complexity, 441p; Dantzig, G., Ramser, J., The truck dispatching problem (1959) Manage. Sci, 6, pp. 80-91; Das, A., Mathieu, C., A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing (2010) Proceedings of the Twenty-first Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2010, pp. 390-403. , http://dl.acm.org/citation.cfm?id=1873601.1873634, Society for Industrial and Applied Mathematics, Philadelphia; Das, A., Mathieu, C., A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (2014) Algorithmica, 73, pp. 115-142; Deineko, V.G., Klinz, B., Tiskin, A., Woeginger, G.J., Four-point conditions for the TSP: The complete complexity classification (2014) Discrete Optim, 14, pp. 147-159; Golden, B., Raghavan, S., Wasil, E., (2008) The Vehicle Routing Problem: Latest Advances and New Challenges, , (eds.), perations Research/Computer Science Interfaces, 1st edn. Springer, US; Haimovich, M., Rinnooy Kan, A.H.G., Bounds and heuristics for capacitated routing problems (1985) Math. Oper. Res, 10 (4), pp. 527-542; Khachai, M., Neznakhina, E., Approximability of the problem about a minimum-weight cycle cover of a graph (2015) Doklady Math, 91 (2), pp. 240-245. , http://dx.doi.org/10.1134/S1064562415020313; Khachai, M., Neznakhina, E., A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (2015) Proc. Steklov Inst. Math, 289 (1), pp. 111-125. , http://dx.doi.org/10.1134/S0081543815050107; Kumar, S., Panneerselvam, R., A survey on the vehicle routing problem and its variants (2012) Intell. Inf. Manage, 4, pp. 66-74; Lenstra, J., Rinnooy Kan, A., Complexity of vehicle routing and scheduling problems (1981) Networks, 11, pp. 221-227; Manthey, B., On approximating restricted cycle covers (2008) SIAM J. Comput, 38, pp. 181-206; Manthey, B., Minimum-weight cycle covers and their approximability (2009) Discrete Appl. Math, 157, pp. 1470-1480; Papadimitriou, C., Euclidean TSP is NP-complete (1997) Theoret. Comput. Sci, 4 (3), pp. 237-244; Sahni, S., Gonzales, T., P-complete approximation problems (1976) J. ACM, 23, pp. 555-565; Toth, P., Vigo, D., The Vehicle Routing Problem (2001) Monographs on Discrete Mathematics and Applications, , SIAM |