452: Combinatorial Optimization

Description

Efficient methods and min-max results for combinatorial optimization problems, including minimum spanning trees, shortest paths, maximum flows, minimum cost flows, matching; polyhedral combinatorics; complexity theory.

Prerequisites

IE 450-1 or equivalent

Offerings

Instructor(s)

File(s)

Textbook(s)