Elements of dynamic programming in extremal route problems

The paper considers the routing problem of visiting megalopolises, that is complicated by constraints in the form of precedence conditions and work within megalopolises; it is assumed that the cost function may depend on the job list. It is noted that the application of the theory may be associated with the task of disassembly the decommissioned nuclear plant. In this problem, the cost of moving depends on the list of outstanding tasks: not removed pieces of equipment emit. It is shown that the computational difficulty of the constructed algorithms requires the use of parallel structure elements.