One bottleneck routing problem

An extremal routing problem with a criterion that has the sense of the greatest edge length of a polygonal line is considered. It is assumed that the costs at every step (stage) of the travel may depend on a list of tasks that have not been fulfilled by the beginning of this step. In addition, there are constraints in the form of precedence conditions. An economical variant of the procedure is constructed based on the dynamic programming method.