1. Arora, S.: Polynomial-programming: methods and applications. In: Reeves, C.R. (ed.) NATO Advanced Study Institute Series, Series C: Mathematics and Physics Science, vol. 19, pp. 1730–178. Reidel, Dordrecht (1975)
2. Baburin, A.E., Gimadi, E.Kh.: On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space. Proc. Steklov Inst. Math. 272(Suppl. 1), 1–13 (2011)
3. Christodes, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Symposium on New Directions and Recent Results in Algorithms and Complexity, p. 441. Academic Press, New York (1976)
4. Gabow, H.N.: An efficient reduction technique for degree-restricted subgraph and bidirected network flow problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing 1983, Boston, USA, pp. 448–456. ACM, New York (1983)
5. Gimadi, E.Kh.: A new version of the asymptotically optimal algorithm for solving the Euclidean maximum traveling salesman problem. In: Proceeding of the 12th Baykal International Conference 2001, Irkutsk, vol. 1, pp. 117–123 (2009). (in Russian)