Close Menu

CS 538 - Combinatorial Optimization

Course Description: 

Linear programs and their properties. Efficient algorithms for linear programming. Network flows, minimum cost flows, maximum matching, weighted matching, matroids.Prerequisite:CS 430 and a linear algebra course.

Credit: 

(3-0-3)

Prerequisite: 

[(CS 430 with min. grade of C)]

Corequisite: 

None

Attachments: