Question: In the minimum flow problem we wish to send a flow f of minimum value from the source to the sink such that f satisfies
In the minimum flow problem we wish to send a flow f of minimum value from the source to the sink such that f satisfies the lower and upper bounds on every arc (lower bound lij 0 and well as an upper bound uij). How could you solve it using two applications of the Ford Fulkerson algorithm on modified graphs with no lower bounds? Thanks!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
