Consider the Ford-Fulkerson algorithm as described in Section 3.2 (augmenting paths have as few arcs as possible). This exercise shows that the algorithm terminates and solves the max-flow problem in...


Consider the Ford-Fulkerson algorithm as described in Section 3.2 (augmenting paths have as few arcs as possible). This exercise shows that the algorithm terminates and solves the max-flow problem in polynomial time, even when the problem data are irrational. Let x0 be the initial feasible flow vector; let xk, k = 1, 2,..., be the flow vector after the kth augmentation; and let Pk be the corresponding augmenting path. An arc (i, j) is said to be a k+-bottleneck if (i, j) is a forward arc of Pk
and xk ij = cij , and it is said to be a k−-bottleneck if (i, j) is a backward arc of Pk and xk I­
= bij . (a) Sh




May 12, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here