ISYE 676 - Discrete Optimization

Study of concepts, theories, and techniques of discrete optimization, both integer and combinatorial. Topics include polyhedral theory, theory of valid inequalities, computational complexity, polynomial algorithms, nonpolynomial algorithms, and nonexact algorithms. Applications include problems in graphs, networks, transportation, and scheduling.

Prerequisites & Notes
PRQ: ISYE 370 or consent of department.

Credits: 3