This preview shows pages 1–2. Sign up to view the full content.
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 5 The Baseball Elimination Problem Due date: 4:00pm on Wednesday, October 7, 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 6 on the baseball elimination problem. Make sure to put your name, netid, and lab section on the first page and staple the problems in order. 1. (40 points) You compute the maximum flow and the minimum cut in a graph G = ( V,E ) with source s and sink t where the edge capacity of each arc ( v,w ) E is equal to u ( v,w ) , using the Ford- Fulkerson algorithm. The source side of the resulting cut is the set of nodes S , and the sink side of the cut is the set of nodes T (where S and T are disjoint and their union is the entire node set V- that is, each node in V is in exactly one of these two sets). (a) (10) Write an expression for the capacity of the cut. (That is, something with a in it!) (b) (20) Unfortunately, when running the algorithm you did everything exactly right, but then you made the mistake of computing the capacity of the minimum cut in the wrong way. That is,made the mistake of computing the capacity of the minimum cut in the wrong way....
View Full Document
This note was uploaded on 09/07/2011 for the course OR 1101 taught by Professor Trotter during the Fall '09 term at Cornell University (Engineering School).
- Fall '09