Profile-Based Optimal Matchings in the Student/Project Allocation Problem

DOI10.1007/978-3-319-19315-1_19zbMath1401.05236arXiv1403.0751OpenAlexW1870236426MaRDI QIDQ2946056

Robert W. Irving, Augustine Kwanashie, David F. Manlove, Colin T. S. Sng

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0751

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Profile-Based Optimal Matchings in the Student/Project Allocation Problem ⋮ An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department ⋮ Matchings with lower quotas: algorithms and complexity ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Super-stability in the student-project allocation problem with ties ⋮ Student-project allocation with preferences over projects: algorithmic and experimental results ⋮ A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximation bounds for the student-project allocation problem with preferences over projects
• Two algorithms for the student-project allocation problem
• Student-project allocation with preferences over projects
• On a conjecture by Gale about one-sided matching problems
• Rank-maximal matchings
• Profile-Based Optimal Matchings in the Student/Project Allocation Problem
• Fair Matchings and Related Problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Algorithmics of Matching Under Preferences

This page was built for publication: Profile-Based Optimal Matchings in the Student/Project Allocation Problem