How can colleges find successful applicants? Criteria such as GPA, interviews, essays, and tests provide information about candidates, but which work and why? We shed light on these questions using unique data on the universe of objective and subjective rankings of all college applicants in...

How can colleges find successful applicants? Criteria such as GPA, interviews, essays, and tests provide information about candidates, but which work and why? We shed light on these questions using unique data on the universe of objective and subjective rankings of all college applicants in...

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired...

This paper discusses the problem of room usage optimization for university timetables: given a timetable, we want to optimize the room occupation by determining the events allocated to each room, while ensuring that the rooms have enough capacity to "seat" all people participating in those...