Discrete Control and Optimal Dynamic Flow Problems on Networks
In this chapter we consider another important generalization of discrete control problems which leads to optimal dynamic flow problems on networks. We show that the time-expanded network method can be extended for such kind of problems and efficient algorithms for determining optimal flows in dynamic networks can be derived. For the considered class of problems the gametheoretical concept can be applied in an analogous way as for the problems from the previous chapters and new classes of games on dynamic networks will be obtained.
KeywordsCost Function Minimum Cost Static Network Dynamic Network Transition Time
Unable to display preview. Download preview PDF.