IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-981-32-9967-2_16.html
   My bibliography  Save this book chapter

Flow in Networks

In: Advanced Optimization and Operations Research

Author

Listed:
  • Asoke Kumar Bhunia

    (The University of Burdwan)

  • Laxminarayan Sahoo

    (Raniganj Girls’ College)

  • Ali Akbar Shaikh

    (The University of Burdwan)

Abstract

The objectives of this chapter are to: Present ideas on graphs and their properties Study flow and potential in networks Discuss the solution procedure of a minimum path problem when all arc lengths are either non-negative or unrestricted in sign Present ideas on network flow, maximum flow problems and generalized maximum flow problems Discuss the source, the sink of a flow, the cut and its capacity in a network flow problem and also the proof of the max-flow min-cut theorem Discuss the solution procedure of maximum flow problems Derive the LPP formulation of a network.

Suggested Citation

  • Asoke Kumar Bhunia & Laxminarayan Sahoo & Ali Akbar Shaikh, 2019. "Flow in Networks," Springer Optimization and Its Applications, in: Advanced Optimization and Operations Research, chapter 0, pages 487-519, Springer.
    • Handle: RePEc:spr:spochp:978-981-32-9967-2_16
    DOI: 10.1007/978-981-32-9967-2_16
    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.

    More about this item

    Statistics

    Access and download statistics

    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-981-32-9967-2_16. 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.