MATH 5660: Discrete Optimization
(Dual-listed with MATH 4660).
Credits: 3. Contact Hours: Lecture 3.
Prereq: Graduate Standing or Permission of Instructor
Algorithms for linear programming, integer and combinatorial optimization. Linear programming, duality theory, simplex algorithm; the solution of the shortest-path, minimum spanning tree, max-flow/min-cut, minimum cost flow, maximum matching, and traveling salesman problems; integer linear programming, branch-and-bound, local and global search algorithms; matroids and greedy algorithms.
(Typically Offered: Fall)