IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-0754-6_13.html
   My bibliography  Save this book chapter

Optimal Flows in Dynamic Networks and Algorithms for their Finding

In: Handbook of Optimization in Complex Networks

Author

Listed:
  • Maria Fonoberova

    (Aimdyn, Inc.)

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.

Suggested Citation

  • Maria Fonoberova, 2012. "Optimal Flows in Dynamic Networks and Algorithms for their Finding," Springer Optimization and Its Applications, in: My T. Thai & Panos M. Pardalos (ed.), Handbook of Optimization in Complex Networks, edition 1, chapter 0, pages 363-403, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-0754-6_13
    DOI: 10.1007/978-1-4614-0754-6_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4614-0754-6_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.