457: Integer Programming

Description

Methods for NP-hard discrete optimization problems, including general methods like branch and bound and cutting planes, as well as special purpose branch-andcut methods and heuristics.

Prerequisites

IE 450-1 or equivalent

Offerings

Instructor(s)

File(s)

Textbook(s)