CS 5135
Computational Integer Programming
This course in Discrete Optimization is focused on Nondeterministic Polynomial-hard problems but with a very strong focus on the use of Mixed-Integer Linear Programming, general-purpose solvers to attack them.
Topics
- Ability to express combinatorial optimization problems by models with linear constraints and integer variables.
- Discriminate among various types of models depending on their solvability with modern mixed-integer programming solvers.
- Analyze the complexity of the most important combinatorial optimization problems.
- Understand, design and implement mixed-integer programming algorithms to solve the developed models.
Official roster learning outcomes
Sources
- Course catalogue ↗2026-2027