Abstract:
A variant of the generalized courier problem with internal tasks (performed at target sets) is considered. The possible variants of travels are restricted by points, which are elements of sections of multivalued mappings. A solution based on the dynamic programming method is investigated.