CO 351 Network Flow TheoryCombinatorics and Optimization (2009-2010)
Review of linear programming. Shortest path problems. The max-flow min-cut theorem and applications. Minimum cost flow problems. Network simplex and primal-dual algorithms. Applications to problems of transportation, distribution, job assignments and critical-path planning. [Offered: F,W,S]
Prerequisites: CO 350 or CO 352/CM 340 or CO 355, MATH 239; Not open to General Mathematics students
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Furino, Steven C | 08:30-09:20 M T W Th F | 27/40 | 1 | 1 | RCH 207 | 4769 | ||
Sections For Spring 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Swamy, Chaitanya | 10:30-11:20 M T W Th F | 35/60 | 1 | 1 | MC 4040 | 3139 | ||