Stable Matching:
An integer linear programming (ILP) application.

Project Overview

As CS majors, we are all intimately familiar with the struggles of course registration. In recent years, the Carleton CS department has attempted to mitigate the challenges posed by registration for classes in the department by adopting a method called the CS Match. This pre-registration process takes in a list from every participating student that contains a ranking of CS courses they would like to take and matches them to a single course using an adaptation of the Gale-Shapley algorithm. Given the complexity of the CS Match process, we sought to investigate another approach to solve this problem that can account for more factors. Hence, for our Comprehensive Exercise, we studied integer linear programming (ILP) and its application to the problem of matching students to classes.