Revisiting two-sided stability constraints

DOI10.1007/978-3-319-33954-2_25MaRDI QIDQ2815123zbMATH OpenOpenAlexFDO

Authors Mohamed Siala, Barry O'Sullivan

Publication date 27 June 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_25

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Matching models (91B68)

Recommendations

• The stable marriage problem with restricted pairs.
• Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
• STACS 2004
• scientific article; zbMATH DE number 1962834
• Keeping partners together: Algorithmic results for the hospitals/residents problem with couples

Cited in

(2)

• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences

This page was built for publication: Revisiting two-sided stability constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815123)