ORIE 5135 - Computational Integer Programming

(crosslisted) CS 5135

Spring. 3 credits. Letter grades only.

Prerequisite: ORIE 5380/CS 5727 or some knowledge of linear programming. Enrollment limited to: Cornell Tech students. Offered in New York City at Cornell Tech.

A. Lodi.

This course in Discrete Optimization is focused on Nondeterministic Polynomial-hard problems but with a very strong focus on the use of Mixed-Integer Linear Programming, general-purpose solvers to attack them.

Outcome 1: Ability to express combinatorial optimization problems by models with linear constraints and integer variables.

Outcome 2: Discriminate among various types of models depending on their solvability with modern mixed-integer programming solvers.

Outcome 3: Analyze the complexity of the most important combinatorial optimization problems.

Outcome 4: Understand, design and implement mixed-integer programming algorithms to solve the developed models.

Print this Page