Pages that link to "Item:Q1737478"
From MaRDI portal
The following pages link to Mathematical models for stable matching problems with ties and incomplete lists (Q1737478):
Displaying 13 items.
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Power indices for networks, with applications to matching markets (Q2106759) (← links)
- Non-monetary coordination mechanisms for time slot allocation in warehouse delivery (Q2189884) (← links)
- Stable fractional matchings (Q2238635) (← links)
- The rank pricing problem with ties (Q2239986) (← 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)
- Online voluntary mentoring: optimising the assignment of students and mentors (Q6106994) (← links)
- Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games (Q6119818) (← 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)
