1. D. Applegate, R. Bixby, V. Chvátal, W. Cook, Concorde: a code for solving Traveling Salesman Problems, 1999. .
2. D. Applegate, R. Bixby, V. Chvátal, W. Cook, Finding tours in TSP, Research Institute for Discrete Mathematics, Universitat Bonn, Bonn, Germany, 99885, 1999.
3. Chained Lin–Kernighan for large traveling salesman problems;Applegate;INFORMS Journal on Computing,2003
4. Fast algorithms for geometric traveling salesman problems;Bentley;ORSA Journal on Computing,1992
5. An efficient implementation for sparse sets;Briggs;ACM Letters on Programming Languages and Systems,1993