• Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Maximum flow; intermediate node; threshold requirements; pseudo or priority arcs; conservation of flows

    • Abstract


      The conventional Maximum flow problem is modified to take account of possible requirements at intermediate nodes across which flow takes place. This is achieved by incorporating pseudo or priority arcs to act as thresholds controlling out-flow from the nodes and modifying the Ford and Fulkerson algorithm to take account of these thresholds.

      Effect of introducing these threshold-requirements at intermediate nodes on the final flow into the sink in the network is examined by some numerical examples.

    • Author Affiliations


      S N Narahari Pandit1 B Krishna Reddy1

      1. Department of Statistics, Osmania University, Hyderabad - 500 007, India
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.