The topic changes from year to year. The topic for fall 2012 is "Combinatorial Optimization Algorithms." We will examine algorithms for a range of optimization problems, including linear programming, matching, computation of network flows, and integer programming. Many of the algorithms are both surprising and efficient. Topics will include the simplex algorithm, duality, primal-dual algorithms, and cutting-plane algorithms.
Requisite: COSC 121 and 201. Fall semester. Professor L. McGeoch.