| References |
Arora, S., (1998), Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM, 45; Balas, E., New classes of efficiently solvable generalized traveling salesman problems (1999) Annals of Operations Research, 86, pp. 529-558; Bellman, R., Dynamic programming treatment of the travelling salesman problem. J (1962) ACM, 9 (1), pp. 61-63; 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; Chentsov, A., Chentsov, A., Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations (2001) Mathematical and Computer Modelling, 33 (8-9), pp. 3801-3819; Christofides, N., (1975), Worst-case analysis of a new heuristic for the traveling salesman problem. In Symposium on New Directions and Recent Results in Algorithms and Complexity, 441; Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (2009), Introduction to Algorithms. MIT, 3 edition; Deineko, V.G., Klinz, B., Tiskin, A., Woeginger, G.J., Four-point conditions for the TSP: The complete complexity classification (2014) Discrete Optimization, 14, pp. 147-159. , doi:10.1016/j.disopt.2014.09.003; Garone, E., Determe, J.F., Naldi, R., (2014), Generalized traveling salesman problem for carrier-vehicle systems. Journal of Guidance Control and Dynamics, 37,766-77A; Gutin, G., Karapetyan, D., (2010) A memetic algorithm for the generalized traveling salesman problem, 9 (1), pp. 47-60; Held, M., Karp, R.M., (1961), A dynamic programming approach to sequencing problems. In Proceedings of the 1961 16th ACM National Meeting, ACM ‘61, 71.201-71.204. ACM, New York, NY, USA; Helsgaun, K., Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (2015) Mathematical Programming Computation, pp. 1-19; Jun-man, K., Yi, Z., (2012), Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Procedia, 17, Part A(0), 319 - 325; Karapetyan, D., Gutin, G., Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (2011) European Journal of Operational Research, 208 (3), pp. 221-232; Khachai, M., Neznakhina, E., A polynomial-time approximation scheme for the euclidean problem on a cycle cover of a graph (2015) Proceedings of the Steklov Institute of Mathematics, 289 (1), pp. 111-125. , doi: 10.1134/S0081543815050107; Khachay, M., Neznakhina, K., (2015) Approximability of the minimum-weight k-size cycle cover problem. Journal of Global Optimization. doi:10.1007/sl0898-015-0391-3, , http://dx.doi.org/10.1007/sl0898-015-0391-3; 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; Steiner, G., On the complexity of dynamic programming for sequencing problems with precedence constraints (1990) Annals of Operations Research, 26 (1), pp. 103-123 |