Mathematical models for stable matching problems with ties and incomplete lists
From MaRDI portal
Publication:1737478
DOI10.1016/j.ejor.2019.03.017zbMath1431.91252OpenAlexW4213120906WikidataQ128216118 ScholiaQ128216118MaRDI QIDQ1737478
Sergio García, Maxence Delorme, Jacek Gondzio, Jörg Kalcsics, William Pettersson, David F. Manlove
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.03.017
assignmentstable marriage problemexact algorithmshospitals/residents problemties and incomplete lists
Related Items (13)
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach ⋮ Review of the theory of stable matchings and contract systems ⋮ Non-monetary coordination mechanisms for time slot allocation in warehouse delivery ⋮ Online voluntary mentoring: optimising the assignment of students and mentors ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ Cutoff stability under distributional constraints with an application to summer internship matching ⋮ Novel integer programming models for the stable kidney exchange problem ⋮ Stable fractional matchings ⋮ The rank pricing problem with ties ⋮ Improving solution times for stable matching problems through preprocessing ⋮ College admissions with ties and common quotas: integer programming approach ⋮ The stable marriage problem with ties and restricted edges ⋮ Power indices for networks, with applications to matching markets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Integer programming methods for special college admissions problems
- Event-based MILP models for resource-constrained project scheduling problems
- Geometric stable roommates
- Stable marriage with ties and bounded length preference lists
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- Stable marriage and indifference
- Hard variants of stable marriage.
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Linear time local approximation algorithm for maximum stable marriage
- Faster and simpler approximation of stable matchings
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- Solving Large p-Median Problems with a Radius Formulation
- Kidney Exchange
- The Stable Roommates Problem with Globally Ranked Pairs
- Improved approximation results for the stable marriage problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Faster Scaling Algorithms for Network Problems
- Algorithmics of Matching Under Preferences
- Finding large stable matchings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
This page was built for publication: Mathematical models for stable matching problems with ties and incomplete lists
