Extremal bottleneck routing problem with constraints in the form of precedence conditions

An extremal routing problem under constraints in the form of precedence conditions is considered. The quality criterion is the length of the greatest edge of a trajectory. An economical version of a computational procedure based on the dynamic programming method is constructed.