Abstract
We introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time. Our experimental study on hard instances of sex-equal and balanced stable matching shows the efficiency of one of our propositions as compared with the state-of-the-art constraint programming approach.
Cite
CITATION STYLE
Siala, M., & O’Sullivan, B. (2017). Rotation-based formulation for stable matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10416 LNCS, pp. 262–277). Springer Verlag. https://doi.org/10.1007/978-3-319-66158-2_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
