Transcription of Lecture 20 Max-Flow Problem and Augmenting Path Algorithm
{{id}} {{{paragraph}}}
Lecture 20 Max-Flow Problemand Augmenting Path AlgorithmOctober 28, 2009 Lecture 20 Outline Max-Flow Problem Description Some examples Algorithm for solving Max-Flow Problem Augmenting path algorithmOperations Research Methods1 Lecture 20 Max-Flow Problem : Single-Source Single-SinkWe are given a directed capacitated network(V, E, C)connecting a source(origin) node with a sink (destination) setVis the set of nodes in the setEis the set of directed links(i, j)The setCis the set of capacitiescij 0of the links(i, j) Problem is to determine themaximum amount of flowthat can besent from the source node to the sink isMax-Flow Problemfor single-source and single-sinkOperations Research Methods2 Lecture 20 Max-Flow Problem .
Lecture 20 Max-Flow Problem: Single-Source Single-Sink We are given a directed capacitated network (V,E,C) connecting a source (origin) node with a sink (destination) node. The set V is the set of nodes in the network. The set E is the set of directed links (i,j) The set C is the set of capacities c ij ≥ 0 of the links (i,j) ∈ E. The problem is to determine the maximum amount of flow that ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}