Read our cookies policy and privacy statement for more information.
×Dekalb, Illinois
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
Units: 3.0