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] Prereq: CO 351 or 255/355; Cumulative overall average of at least 80%; Not open to General Mathematics students
