Routing with conditions depending on the list of tasks

The talk is concerned with the additive problem of sequantional routing of megapolises with precedence conditions. It's assumed that the payoff functions and running constrains depend on the list of tasks. The dynamic programming method is developed. The results of numerical simulations will be presented.