This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: construction described in the handout to formulate this problem as a maximum ±ow problem. 1 (b) (30 points) It turns out that half of the faculty have left FUN. Now each advisor will take at most two new advisees, and the students have given their choices from among the remaining ±ve advisors. Once again, we wish to maximize the number of students assigned to one of their two choices. Take the data given below, and formulate this new problem as a maximum ²ow problem. (Hint: in this new formulation not all of the arc capacities will be 1.) Student # Choice #1 Choice #2 1 A C 2 B D 3 A C 4 D A 5 A C 6 B A 7 D A 8 E B 9 B A 10 B E Be sure to explain why your formulation is correct; in this explanation, be sure to explain how the integrality property is important. 2...
View Full Document
- Fall '05
- advisor, Flow network, Maximum flow problem, Network flow, Ford–Fulkerson algorithm