Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations

For the generalized traveling salesman problem, the known dynamic programming method (DPM) under conditions of inexact calculations of the Bellman function is investigated. Concrete estimates of the errors under the realization of the global extremum are obtained. In the scope of the basic problem, the important question about the sequential circuit of the sections of set-valued mappings is considered.