Discrete Optimization — Fundamentals of integer and combinatorial optimization. Topics include polyhedra, cuts, Lagrangean duality, complexity, and others. This course is intended for Ph.D. students.
Prereqs: ISYE6661
Taught by nobody this semester.