| References |
Arora, S., Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems (1998) Journal of the ACM, 45; Bhattacharya, B., Ćustić, A., Rafiey, A., Rafiey, A., Sokol, V., (2015) Combinatorial Optimization and Applications: 9th International Conference, COCOA 2015, pp. 110-125. , Houston, TX, USA, December 18-20 Proceedings, chap. Approximation Algorithms for Generalized MST and TSP in Grid Clusters LNCS, Springer International Publishing, Cham (2015); Bontoux, B., Artigues, C., Feillet, D., A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (2010) Computers & Operations Research, 37 (11), pp. 1844-1852; Bovet, J., Selective traveling salesman problem (1983) The EURO VI Conference, , Papers Presented at Vienna; Chentsov, A., Khachay, M., Khachay, D., An exact algorithm with linear complexity for a problem of visiting megalopolises (2016) Proceedings of the Steklov Institute of Mathematics, 295; 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; Gimadi, E.K., Rykov, I.A., On the asymptotic optimality of a solution of the euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight (2016) Doklady Mathematics, 93 (1), pp. 117-120; Grigoriev, A., (2016) On Fixed Parameter Tractability of GTSP, , personal communication; Gutin, G., Karapetyan, D., (2010) A Memetic Algorithm for the Generalized Traveling Salesman Problem, 9 (1), pp. 47-60; Held, M., Karp, R.M., A dynamic programming approach to sequencing problems (1961) Proceedings of the 1961 16th ACM National Meeting, pp. 71201-71204. , ACM '61, ACM, New York, NY, USA; Henry-Labordere, A., The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem (1969) RIBO, B-2, pp. 736-743; Junman, K., Yi, Z., Application of an improved ant colony optimization on generalized traveling salesman problem (2012) Energy Procedia, 17, pp. 319-325; Khachay, M., Neznakhina, K., Approximability of the minimum-weight k-size cycle cover problem (2015) Journal of Global Optimization, , http://dx.doi.org/10.1007/s10898-015-0391-3; Laporte, G., Nobert, Y., Generalized travelling salesman problem through n sets of nodes: An integer programming approach (1983) Informatica, 21, pp. 61-75; Laporte, G., Mercure, H., Nobert, Y., Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (1987) Discrete Applied Mathematics, 18 (2), pp. 185-197; Pop, P.C., Matei, O., Sabo, C., (2010) Hybrid Metaheuristics: 7th International Workshop, HM 2010, pp. 62-72. , Vienna, Austria, October 1-2 Proceedings, chap. A New Approach for Solving the Generalized Traveling Salesman Problem Springer Berlin Heidelberg, Berlin, Heidelberg (2010); Saksena, J., Mathematical model for scheduling clients through welfare agencies (1970) CORS Journal, 8, pp. 185-200; Srivastava, S., Kumar, S., Garg, R., Sen, P., Generalized travelling salesman problem through n sets of nodes (1969) CORS Journal, 7, pp. 77-101; Steiner, G., On the complexity of dynamic programming for sequencing problems with precedence constraints (1990) Annals of Operations Research, 26 (1), pp. 103-123 |