COMBINATORIAL OPTIMIZATION

Undergraduate

In this course, various algorithms will be considered, including minimum spanning tree, shortest path, maximum flow, and maximum matching. The links with linear and integer programming will also be considered, with particular attention to duality. PREREQUISITES: MATH 2420 Three lecture hours per week