| References |
Arora, S., Polynomial-time approximation schemes for euclidean traveling salesman and other geometric problems (1998) J. ACM, 45, pp. 753-782; Baburin, A., Della Croce, F., 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; Bektas, T., The multiple traveling salesman problem: an overview of formulations and solution procedures (2006) Omega, 34, pp. 209-219; Bläser, M., Manthey, B., Approximating maximum weight cycle covers in directed graphs with weights zero and one (2005) Algorithmica, 42, pp. 121-139; Bläser, M., Manthey, B., Sgall, J., An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (2006) J. Discrete Algorithms, 4, pp. 623-632; Bläser, M., Siebert, B., Computing cycle covers without short cycles (2001) Algorithms ESA 2001, pp. 368-379. , Springer, Berlin; Chandran, L.S., Ram, L.S., On the relationship between ATSP and the cycle cover problem (2007) Theor. Comput. Sci., 370, pp. 218-228; 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, p. 441; Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E., (2001) Introduction to Algorithms, , McGraw-Hill Higher Education, New York; Dantzig, G.B., Ramser, J.H., The truck dispatching problem (1959) Manag. Sci., 6 (1), pp. 80-91; De Kort, J., Lower bounds for symmetric k-peripatetic salesman problems (1991) Optimization, 20, pp. 113-122; Finkel, R.A., Bentley, J.L., Quad trees: a data structure for retrieval on composite keys (1974) Acta Inf., 4, pp. 1-9; Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , W. H. Freeman & Co., New York; 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. S57-S67; Golden, B., Raghavan, S., Wasil, E.A., (2008) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, , 43, Springer, Berlin; Jung, H., Über die kleinste kugel, die eine räumliche figur einschliesst (1901) J. Reine Angew. Math., 123, pp. 241-257; Krarup, J., Roy, B., The peripatetic salesman and some related unsolved problems (1975) Combinatorial Programming: Methods and Applications, pp. 173-178. , Springer, Netherlands; Kumar, S., Panneerselvam, R., A survey on the vehicle routing problem and its variants (2012) Intell. Inf. Manag., 4, pp. 66-74; 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 (1977) Theor. Comput. Sci., 4 (3), pp. 237-244; Sahni, S., Gonzales, T., P-complete approximation problems (1976) J. ACM, 23, pp. 555-565; Szwarcfiter, J., Wilson, L., The cycle cover problem. Tech. Rep. 131 (1979) University of Newcastle upon Tyne; Toth, P., Vigo, D., (2001) The Vehicle Routing Problem, , (eds), Society for Industrial and Applied Mathematics, Philadelphia |