Computing algorithms for solution of some linear and linear integer programming problems. IV

An accurate algorithm for solution of the traveling salesman problem is described which employs a method for improving a certain lower bound of the initial functions, the $l$-functional, developed in [1].