On one modification of the traveling salesman problem

The traveling salesman problem of the paper has constraints on the itinerary. By redefining the initial distance function the problem is shown reducible to a common traveling salesman problem. A class of constraints on the original distance function is identified with which the problem dimension can be reduced.