1. Aggarwal, A., Klawe, M. M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica2, 195–208 (1978).
2. Bhat, K. V. S.: The optimum assignments and a new heuristic approach for the traveling salesman problem. Inform. Sciences27, 121–132 (1992).
3. Burdyuk, V. Ya., Trofimov, V. N.: Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem (in Russian). Izv. Akad. Nauk SASS, Tech. Kibernet.3, 16–22 (1976) [Translation: Engineering Cybernetics14, 12–18 (1976)].
4. Carlier, J., Villon, P.: A new heuristic for the travelling salesman problem. Recherche opérationelle (RAIRO)24, 245–253 (1990).
5. Deineko, V. G.: Applying a dynamic programming to solving a special traveling salesmen problem (in Russian). Issledovanie operaziy i ASU, Kiev 14, 47–50 (1979).