Student-project allocation with preferences over projects

DOI10.1016/j.jda.2008.07.003zbMath1154.90631MaRDI QIDQ1002100

Gregg O'Malley, David F. Manlove

Publication date: 23 February 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.07.003

zbMATH Keywords

approximation algorithm; matching problem; NP-hardness; stable matching; approximation hardness

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem, Super-stability in the student-project allocation problem with ties, Improved approximation bounds for the student-project allocation problem with preferences over projects, An assignment problem and its application in education domain: a review and potential path, Two algorithms for the student-project allocation problem, The stable marriage problem with master preference lists, Matchings with lower quotas: algorithms and complexity, Handling preferences in student-project allocation, Student-project allocation with preferences over projects: algorithmic and experimental results, An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department, Profile-Based Optimal Matchings in the Student/Project Allocation Problem, Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects

Cites Work

• Unnamed Item
• Two algorithms for the student-project allocation problem
• Approximability results for stable marriage problems with ties.
• A genetic algorithm for the project assignment problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Algorithms and Computation
• College Admissions and the Stability of Marriage