Discrete Control and Optimal Dynamic Flow Problems on Networks

  • Dmitrii Lozovanu
  • Stefan Pickl

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.


Cost Function Minimum Cost Static Network Dynamic Network Transition Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dmitrii Lozovanu
    • 1
  • Stefan Pickl
    • 2
  1. 1.Academy of Sciences of MoldovaChisinauMoldova
  2. 2.Universität der BundeswehrMünchenGermany

Personalised recommendations