Academics

  /  

Courses

  /  

Descriptions

IEMS 452: Combinatorial Optimization

VIEW ALL COURSE TIMES AND SESSIONS

Prerequisites

IE 450-1 or equivalent

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.