| References |
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , Freeman, San Fransisco; Papadimitriou, C., Euclidean TSP is NP-complete (1977) Theoret. Comput. Sci, 4, pp. 237-244; Sahni, S., Gonzalez, T., P-complete approximation problems (1976) J. Assoc. Comput. Mach, 23 (3), pp. 555-565; Christofides, N., Worst-case analysis of a new heuristic for the traveling salesman problem (1976) Algorithms and Complexity: New Directions and Recent Results, p. 441. , Academic, New York; Arora, S., Polynomial-time approximation schemes for Euclidean traveling salesman and other geometric problems (1998) J. Assoc. Comput. Mach, 45 (5), pp. 753-782; Gimadi, E.K., Perepelitsa, V.A., An asymptotic approach to solving the traveling salesman problem (1974) Control Systems: Collection of Papers, pp. 35-45. , Inst. Mat. SO AN SSSR, Novosibirsk; De Kort, J.B.J.M., Lower bounds for symmetric K-peripatetic salesman problems (1991) Optimization, 22 (1), pp. 113-122; Krarup, J., The peripatetic salesman and some related unsolved problems (1975) Combinatorial Programming: Methods and Applications, pp. 173-178. , Roy B, (ed), NATO Advanced Study Institutes Series, 19, Reidel, Dordrecht; Baburin, A.E., Gimadi, E.K., On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space (2011) Proc. Steklov Inst. Math, 272, pp. 1-13; Gimadi, E., Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space (2008) Proc. Steklov Inst. Math, 263, pp. 57-67; Baburin, A.E., Croce, F.D., Gimadi, E.K., Glazkov, Y.V., Paschos, V.T., Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (2009) Discrete Appl. Math, 157 (9), pp. 1988-1992; Dantzig, G., Ramser, H., The truck dispatching problem (1959) Management Sci, 6 (1), pp. 80-91; Toth, P., Vigo, D., (2001) The Vehicle Routing Problem, , (eds), SIAM, Philadelphia; Golden, B., Raghavan, S., Wassil, E., (2008) The Vehicle Routing Problem: Latest Advances and New Challenges, , (eds), Ser. Operations Research and Computer Science Interfaces, 43, Springer Science and Business Media, New York; Gimadi, E.K., Kel’manov, A.V., Pyatkin, A.V., Khachai, M.Y., Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (2015) Proc. Steklov Inst. Math, 289, pp. 88-101; Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (1990) Introduction to Algorithms, , MIT Press, Cambridge, MA; Finkel, R., Bentley, J., Quad trees: A data structure for retrieval on composite keys (1974) Acta Informatica, 4 (1), 9p |