Abstract
This chapter reviews key classical concepts, results and algorithms related to static flow networks, where no edge or node failures are considered. The concepts and results discussed are necessary for introducing the theory of repairable flow networks and networks with disturbed flows in the next chapters. Among the classical results discussed are: s – t cuts in flow networks and their properties; the necessary and sufficient condition for a maximum throughput flow in a static network; the shortest-path augmentation algorithm for maximising the throughput flow; the preflow-push methods for maximising the throughput flow; the successive shortest-path method for determining the minimum cost flow and the Menger theorems about edge-disjoint and node-disjoint paths. Some applications of static flow networks are also reviewed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
