CO 450 Combinatorial OptimizationCombinatorics and Optimization (2009-2010)
Characterizations of optimal solutions and efficient algorithms for optimization problems over discrete structures. Topics include network flows, optimal matchings, T-joins and postman tours, matroid optimization. [Offered: F]
Prerequisites: CO 351 or 355; Cumulative overall average of at least 80%; Not open to General Mathematics students
Sections For Fall 2009
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Koenemann, Jochen | 08:30-09:50 M T W Th F | 6/12 | 1 | 1 | MC 2038 | 4783 | ||
| Held With: CO 650 | ||||||||
Sections For Spring 2009
CO 450 is not held in Spring 2009