1. Johnson DS, McGeogh L, Glover F, Rego C. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. Technical report, AT&T Labs, 2000 〈http://www.research.att.com/∼dsj/chtsp/〉
2. An effective heuristic algorithm for the traveling salesman problem;Lin;Operations Research,1973
3. Glover F. New ejection chain and alternating path methods for traveling salesman problems. Computer Science and Operations Research (1992) 449–509.
4. Relaxed tours and path ejections for the traveling salesman problem;Rego;European Journal of Operational Research,1998
5. Funke B, Grünert T, Irnich S. A note on single alternating cycle neighborhoods for the TSP, Lehr- und Forschungsgebiet Operations Research und Logistic Management, Rheinisch-Westfälische Hochschule (RWTH) Aachen, Germany, 2003.