Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function

A method for the exact solution of a closed traveling salesman problem with symmetric value function based on the dynamic programming method is presented. The method produces an optimal solution in a smaller number of operations as compared to the classical dynamic programming method. A short experiment, which compares the efficiencies of the classical scheme and of the new scheme in traveling salesman problems of different dimensions, is given in the end of the paper.