Optimal Flows in Dynamic Networks and Algorithms for their Finding

Maria Fonoberova ()
Additional contact information
Maria Fonoberova: Aimdyn, Inc.

Chapter Chapter 13 in Handbook of Optimization in Complex Networks, 2012, pp 363-403 from Springer

Abstract: Abstract The minimum cost flow problem and the maximum flow problem on networks with time-dependent characteristics and nonlinear cost functions on arcs are considered. The algorithms for determining optimal solutions of the single-commodity and multicommodity network flow problems based on the time-expanded network method are elaborated. Some applications of the optimal flow problems are provided.

Keywords: Nash Equilibrium; Dynamic Network; Flow Problem; Multicommodity Flow; Maximum Flow Problem (search for similar items in EconPapers)
Date: 2012
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:spochp:978-1-4614-0754-6_13

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

DOI: 10.1007/978-1-4614-0754-6_13

Access Statistics for this chapter

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