Pages that link to "Item:Q924544"
From MaRDI portal
The following pages link to Two algorithms for the student-project allocation problem (Q924544):
Displaying 17 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- Stability concepts in matching under distributional constraints (Q508390) (← links)
- Win-win match using a genetic algorithm (Q611494) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Student-project allocation with preferences over projects (Q1002100) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Handling preferences in student-project allocation (Q1730741) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Popularity in the generalized hospital residents setting (Q2399378) (← links)
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department (Q2688892) (← links)
- Profile-Based Optimal Matchings in the Student/Project Allocation Problem (Q2946056) (← links)
- Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects (Q3010424) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)
- A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem (Q5140716) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
