Discrete Control and Optimal Dynamic Flow Problems on Networks

Dmitrii Lozovanu and Stefan Pickl ()
Additional contact information
Dmitrii Lozovanu: Academy of Sciences of Moldova
Stefan Pickl: Universität der Bundeswehr

Chapter 4 in Optimization and Multiobjective Control of Time-Discrete Systems, 2009, pp 1-52 from Springer

Abstract: 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.

Keywords: Cost Function; Minimum Cost; Static Network; Dynamic Network; Transition Time (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-85025-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9783540850250

DOI: 10.1007/978-3-540-85025-0_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().