IE 611 Integer Programming
Credit Information:
(3+0+0) 3
Description:
Modeling with integer variables; polyhedral combinatorics; theory of valid inequalities; disjunctive programming; duality and relaxation; linear programming relaxation; enumeration; branch-and-bound using linear programming relaxations; cutting plane algorithms; Lagrangean relaxation and duality; sub-gradient method; column generation technique; reformulation and linearization technique; lift-and-project method; problems with special structure.
Prerequisite:
IE 501 or instructor's consent.
Offered by:
Syllabus:
