1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)
2. Arkin, E.M., Chiang, Y.J., Mitchell, J.S.B., Skiena, S., Yang, T.-C.: On the maximum scatter TSP. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA 97), pp. 211–220 (1997)
3. Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM 45(5), 753–782 (1998)
4. Barvinok, A.I.: Two algorithmic results for the Traveling Salesman Problem. Math. Oper. Res. 21(1), 65–84 (1996)
5. Barvinok, A., Johnson, D.S., Woeginger, G.J., Woodroofe, R.: The maximum Traveling Salesman Problem under polyhedral norms. In: Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference (IPCO VI). Lecture Notes in Computer Science, vol. 1412, pp. 195–201. Springer (1998)