1. E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, in: Proceedings of IPCO V, Lecture Notes in Computer Science 1084, Springer, Berlin, 1996, pp. 316–329
2. E. Balas, P. Toth, Branch and bound methods, in: E.L. Lawler et al. (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 361-401
3. A new heuristic for the traveling salesman problem;Carlier;RAIRO,1990
4. W.J. Cook, W.H. Cunninghan, W.R. Pulleyblank, A. Schrijver, Combinatorial Optimization, Wiley, New York, 1998
5. V. Deineko, G.J. Woeginger, A study of exponential neighbourhoods for the travelling salesman problem and for the quadratic assignment problem, TR Woe-05, TU of Graz, Graz, Austria, 1997