Pages that link to "Item:Q346530"
From MaRDI portal
The following pages link to Integer programming methods for special college admissions problems (Q346530):
Displaying 12 items.
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- University rankings from the revealed preferences of the applicants (Q2184118) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach (Q5060805) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Stable matching: An integer programming approach (Q6053647) (← links)
- Online voluntary mentoring: optimising the assignment of students and mentors (Q6106994) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- Novel integer programming models for the stable kidney exchange problem (Q6167384) (← links)
- Optimization methods and algorithms (Q6536473) (← links)
