CS 5135

CS 5135

Course information provided by the Courses of Study 2021-2022.

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.

When Offered Spring.

Permission Note Enrollment limited to: Cornell Tech students.
Prerequisites/Corequisites Prerequisite: ORIE 5380/CS 5727 or some knowledge of linear programming.

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

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Combined with: ORIE 5135

  • 3 Credits Graded

  • 18512 CS 5135   LEC 030

  • Instruction Mode: In Person
    Taught in NYC. Enrollment limited to Cornell Tech Students Only.