This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall ’09 Homework 4 The Maximum Flow Problem • Due date: 4:00pm on Wednesday, September 30, 2009 in the ENGRI 1101 box at the west end of the corridor on the second floor of Rhodes Hall, where it connects to Upson. • Reading assignment: Handout 5 on the maximum flow problem. • Make sure to put your NAME, NETID, and Lab Section on the first page and staple the problems in order. 1. (60 points) The following figure gives an input to the maximum flow problem, and a feasible flow that has been computed by the Ford-Fulkerson algorithm. 7 3 6 f 6 1 2 3 5 1 5 1 9 5 7 10 1 2 9 5 3 u KEY 2 2 1 4 3 5 6 (a) (30 points) Finish the execution of this algorithm to produce a maximum flow. (b) (15 points) Use the Ford-Fulkerson algorithm to produce a cut of minimum capacity. Be sure to explain your work. (c) (15 points) What is the value of the flow that you have found? What is the capacity of the cut that you have found?...
View Full Document
- Fall '09
- Computer program, Maximum flow problem, Network flow, Ford–Fulkerson algorithm