1. Applegate, D., Bixby, R., Chvtal, V., Cook, W., Mevenkamp, M.: Concorde TSP solver. Last updated Jan. 2005. http://www.tsp.gatech.edu/concorde.html
2. Arkin, E.M., Chiang, Y., Mitchell, J.S.B., Skiena, S.S., Yang, T.: On the maximum scatter traveling salesman problem. SIAM J. Comput. 29, 515–544 (1999)
3. Arora, S.: Approximation algorithms for geometric TSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 207–222. Kluwer Academic, Secaucus (2002), Chap. 5
4. Ball, M.O., Magazine, M.J.: Sequencing of insertions in printed circuit board assembly. Oper. Res. 36, 192–201 (1988)
5. Carpaneto, G., Martello, S., Toth, P.: An algorithm for the bottleneck traveling salesman problem. Oper. Res. 32, 380–389 (1984)