Improving solution times for stable matching problems through preprocessing

DOI10.1016/j.cor.2020.105128OpenAlexW3032996616MaRDI QIDQ2027037

Jörg Kalcsics, Jacek Gondzio, William Pettersson, Maxence Delorme, Sergio García, David F. Manlove

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105128

zbMATH Keywords

stable marriage problempreprocessinghospital/residents problemties and incomplete lists

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Incorporating slot valuation in making airport slot scheduling decisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• College admissions with stable score-limits
• Stable marriage with ties and bounded length preference lists
• Some remarks on the stable matching problem
• Linear programming brings marital bliss
• A tale of two mechanisms: Student placement
• Stable marriage and indifference
• Hard variants of stable marriage.
• Mathematical models for stable matching problems with ties and incomplete lists
• MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY
• Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
• Stability and Polarization of Interests in Job Matching
• The Stable Roommates Problem with Globally Ranked Pairs
• A Constraint Programming Approach to the Hospitals / Residents Problem
• Algorithmics of Matching Under Preferences
• Finding large stable matchings
• College Admissions and the Stability of Marriage

This page was built for publication: Improving solution times for stable matching problems through preprocessing