102 citations · 154 across the 25 of their papers we have counts for
4 papers · 1 filter
Mathematical models for stable matching problems with ties and incomplete lists
Maxence Delorme, Sergio García, Jacek Gondzio +3
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its m…
Super-stability in the Student-Project Allocation Problem with Ties
Sofiat Olaosebikan, David Manlove
The Student-Project Allocation problem with lecturer preferences over Students (SPA-S) involves assigning students to projects based on student preferences over projects, lecturer…
An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects
David Manlove, Duncan Milne, Sofiat Olaosebikan
The Student-Project Allocation problem with preferences over Projects (SPA-P) involves sets of students, projects and lecturers, where the students and lecturers each have preferen…
A 3/2-approximation algorithm for the Student-Project Allocation problem
Frances Cooper, David Manlove
The Student-Project Allocation problem with lecturer preferences over Students (SPA-S) comprises three sets of agents, namely students, projects and lecturers, where students have…