1. E. Kh. Gimadi, “A New Version of an Asymptotically Exact Algorithm Solving the Euclidean Maximum Traveling Salesman Problem,” in Proceedings of XII Baikal International Conference, Vol. 1 (Melentiev Energy Systems Inst., Irkutsk, 2001), pp. 117–123.
2. A. I. Serdyukov, “Asymptotically Exact Algorithm for the Maximum Traveling Salesman Problem in an Euclidean Space,” in Methods of Integer Optimization, Vol. 27 (Inst. Mat., Novosibirsk, 1987), pp. 79–87.
3. A. I. Serdyukov, “The Maximum Traveling Salesman Problemin Finite-Dimensional Real Spaces,” Diskretn. Anal. Issled. Oper. 27(1), 50–56 (1995).
4. A. I. Barvinok, D. S. Johnson, G. Woeginger, and R. Woodroofe, “The Maximum Traveling Salesman Problem under Polyhedral Norms,” in Integer Programming and Combinatorial Optimization (Springer, Berlin, 1998), pp. 195–201 [Lecture Notes on Computer Sciences, Vol. 1412].
5. A. I. Barvinok, S. P. Fekete, D. S. Johnson, A. Tamir, G. Woeginger, and R. Woodroofe, “The Geometric Maximum Traveling Salesman Problem,” J. ACM 50(5), 641–664 (2003).