Description

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.

Lecture Hours: 3.00 Lab Hours: 0Total Hours: 3.00