1. A 5/3-approximation Algorithm for the clustered traveling salesman tour and path problems;Anily;Operations Research Letters,1999
2. The traveling salesman problem: A computational study (Princeton Series in Applied Mathematics);Applegate,2007
3. Chained Lin-Kernighan for large traveling salesman problems;Applegate;INFORMS Journal on Computing,2003
4. Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (2007). Concorde TSP Solver, William Cook, School of Industrial and Systems Engineering, Georgia Tech., 2007. [accessed 22 December 2007].
5. Restricted delivery problems on a network;Arkin;Networks,1997