Computational Optimization

Catalog description

Credits 3. 3 Lecture Hours. Combinatorial theory of polytopes as a tool for the solution of combinatorial optimization problems; applications to max flow, matching and matroids; geometric interpretation of the results indicating the profound role that polyhedral combinatorics play in the design and complexity of approximation algorithms. Prerequisite: CSCE 629 .