1. D. Applegate, R. Bixby, V. Chvátal, W. Cook.Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems, Mathematical Programming, 97 (2003), 91-153.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, A. Y. Wu.An optimal algorithm for approximate nearest neighbor searching, Journal of the ACM, 45 (1998), 891-923.
3. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Technical Report, 388, Graduate School of Industrial Administration, CMU, 1976.
4. N. Christofides, V. Campos, A. Corberan and E. Mota, An Algorithm for the Rural Postman Problem, , Imperical College, London, England, Tech. Report, 1981.
5. W. Cook, Concorde TSP solver, Available at: http://www.math.uwaterloo.ca/tsp/concorde/index.html. [Accessed on March 29, 2019], 2006.