ORIE 5135 - Computational Integer Programming (3 Credits) - A. Lodi
Crosslisted with CS 5135  
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.
Enrollment Information: Enrollment limited to: Cornell Tech students. Recommended prerequisite: ORIE 5380/CS 5727 or some knowledge of linear programming.  
Last Four Terms Offered: Spring 2022  
Learning Outcomes:

• 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.