1. Arora, S.: Polynomial-programming: methods and applications. In: Reeves, C.R. (ed.) NATO Advanced Study Institutes Series, Series C: Mathematical and Physical Sciences, 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. Barvinok, A.I., Gimadi, E.Kh., Serdyukov, A.I.: The maximum TSP. In: Punnen, A., Gutin, G. (eds.) The Traveling Salesman Problem and Its Variations, pp. 585–608. Kluwer Acad. Publ., Dordrecht (2002)
4. Christofides, 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)
5. De Kort, J.B.J.M.: Upper bounds and lower bounds for the symmetric K peripatetic salesman problem. Optimization 23(4), 357–367 (1992)