1. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Concorde: a code for solving traveling salesman problems. http://www.tsp.gatech.edu/concorde.html (1999)
2. Applegate, D., Bixby R., Chvátal V., Cook W.: Finding tours in the TSP. Technical Report 99885, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (1999)
3. Applegate D., Bixby R., Chvátal V., Cook W.: Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems. Math. Prog. 97, 91–153 (2003)
4. Applegate D., Cook W., Rohe A.: Chained Lin–Kernighan for large traveling salesman problems. INFORMS J. Comput. 15, 82–92 (2003)
5. Bergeron A.: A very elementary presentation of the Hannenhalli–Pevzner theory. LNCS 2089, 106–117 (2001)