MATH 6103 Discrete Optimization 3/0/3
Prerequisite: MATH 2853 or MATH 4483
Topics include discrete optimization problems, simplex algorithms, complexity, matching and weighted matching, spanning trees, matroid theory, integer linear programming, approximation algorithms, branch-and-bound, and local search and polyhedral theory.


