Khachay, M., & Neznakhina, K. (2020). Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. Annals of mathematics and artificial intelligence, 88(1-3), 53-69. https://doi.org/10.1007/s10472-019-09626-w
Citácia podle Chicago (17th ed.)Khachay, Michael, a Katherine Neznakhina. "Complexity and Approximability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters." Annals of Mathematics and Artificial Intelligence 88, no. 1-3 (2020): 53-69. https://doi.org/10.1007/s10472-019-09626-w.
Citácia podľa MLA (8th ed.)Khachay, Michael, a Katherine Neznakhina. "Complexity and Approximability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters." Annals of Mathematics and Artificial Intelligence, vol. 88, no. 1-3, 2020, pp. 53-69, https://doi.org/10.1007/s10472-019-09626-w.