On a bottleneck routing problem (Q643816)

The authors focus on an extremal routing problem with a criterion that has the sense of the greatest edge length of a polygonal line. The problem belongs to the class of optimal constrained travel routing under conditions when the quality criterion corresponds to the ``bottleneck problem'' and includes a combination of estimators that may depend on a list of tasks. An economical variant of the procedure is constructed based on the dynamic programming method.