i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/ford-fulkerson... · 2008-05-15 · the...
TRANSCRIPT
![Page 1: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/1.jpg)
The Ford–Fulkerson algorithm Michael Tehranchi
This slideshow illustrates the Ford–Fulkerson algorithm for find-ing a maximal flow through a network.
(0) Assign an initial feasible flow (xij)i,j∈N with value v..
(1) Find an augmenting path 1 = i1, i2, . . . , ir−1, ir = n from node1 to node n.
If no augmenting path exists, then STOP. The flow (xij)i,j∈N isoptimal and there exists a cut with capacity v.
(2) If an augmenting path exists, then increase the flow alongthe path by the amount
δ = mink=1,...,r−1
max{cikik+1− xikik+1
, xik+1ik}
![Page 2: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/2.jpg)
by setting
x′ij =
xij + δ if i, j are consecutive nodes of pathxij − δ if j, i are consecutive nodes of path
xij otherwise
Then (x′ij)i,j∈N is a feasible flow with value v′ = v + δ.
(3) Go to step (1).
![Page 3: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/3.jpg)
![Page 4: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/4.jpg)
![Page 5: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/5.jpg)
![Page 6: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/6.jpg)
![Page 7: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/7.jpg)
![Page 8: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/8.jpg)
![Page 9: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/9.jpg)
![Page 10: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/10.jpg)
![Page 11: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/11.jpg)
![Page 12: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/12.jpg)
![Page 13: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/13.jpg)
![Page 14: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/14.jpg)
![Page 15: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/15.jpg)
![Page 16: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/16.jpg)
![Page 17: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/17.jpg)
![Page 18: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/18.jpg)
![Page 19: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/19.jpg)
![Page 20: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/20.jpg)
![Page 21: i ,i ,,i ,i n from node n x v c x ,xmike/optimisation/Ford-Fulkerson... · 2008-05-15 · The Ford–Fulkerson algorithm Michael Tehranchi This slideshow illustrates the Ford–Fulkerson](https://reader033.vdocuments.mx/reader033/viewer/2022052222/5f0d89237e708231d43ad7d7/html5/thumbnails/21.jpg)