Subject
Mathematics (miscellaneous)
Reference14 articles.
1. A. I. Serdyukov, “An asymptotically optimal algorithm for the maximum traveling salesman problem in Euclidean space,” in Integer Optimization Methods. Controlled Systems (SO AN SSSR, Novosibirsk, 1987), issue 27, pp. 79–87 [in Russian].
2. Ser. Mathematics and Its Applications;A I Serdyukov,1997
3. V. V. Shenmaier, “An asymptotically exact algorithm for the maximum traveling salesman problem in a finite-dimensional normed space,” J. Appl. Ind. Math. 5 (2), 296–300 (2011).
4. A. Barvinok, S. P. Fekete, D. S. Johnson, A. Tamir, G. J. Woeginger, and R. Woodroofe, “The geometric maximum traveling salesman problem,” J. ACM 50 (5), 641–664 (2003). doi https://doi.org/10.1145/876638.876640
5. M. Bläser and B. Manthey, “Approximating maximum weight cycle covers in directed graphs with weights zero and one,” Algorithmica 42 (2), 121–139 (2005). doi https://doi.org/10.1007/s00453-004-1131-0