@inproceedings{9fcf80f5c045461da58d58721a149287,
title = "Rotation-based formulation for stable matching",
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.",
author = "Mohamed Siala and Barry O{\textquoteright}Sullivan",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 ; Conference date: 28-08-2017 Through 01-09-2017",
year = "2017",
doi = "10.1007/978-3-319-66158-2\_17",
language = "English",
isbn = "9783319661575",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "262--277",
editor = "J.Christopher Beck",
booktitle = "Principles and Practice of Constraint Programming - 23rd International Conference CP 2017, Proceedings",
address = "Germany",
}