The traveling salesman problem. Approximate algorithms

This third part of the survey covers a way to develop and estimate the efficiency of heuristic algorithms for solution of the traveling salesman problem. Data is given on the worst behavior of the algorithms. Results of computing experiments are extended. Interactive and hybrid algorithms and methods to solve high dimension problems are discussed.