MATH 4660: Discrete Optimization
(Dual-listed with MATH 5660).
Credits: 3. Contact Hours: Lecture 3.
Prereq: (COMS 2300 or CPRE 3100 or MATH 2010) and (MATH 2070 or MATH 3170 or MATH 4070)
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)