Course Number

EMIS 8373

Catalog Description

A presentation of algorithms for linear integer programming problems. Topics include complexity analysis, cutting plane techniques, and branch-and-bound.

Goals

The course surveys modeling techniques and solution algorithms for integer programming (IP) problems, a class of optimization problems in which some or all of the variables are required to be integer-valued. IP models are in widespread use today and include some of the most challenging (and least challenging) mathematical programming problems.

Prerequisites

EMIS 8360 or 8371

Recent Instructor

Eli Olinick