The Sorting Hat Goes to College.

The article describes a mathematical solution to a combinatorial optimization problem that arises in higher education. Topics discussed include how the classic Assignment Problem for bipartite graphs can be used in combinatorial optimization problem, how Integer Linear Programming leads to more flexibility, and how Integer Linear Programming allows the optimization to be fine-tuned to handle more challenging data sets.