Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-66158-2_17 | PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING (CP 2017) |
Field | DocType | Volume |
Mathematical optimization,Stable marriage problem,Local consistency,Computer science,Constraint programming,Constraint theory,Filtering rules,Time complexity,Computer programming,Encoding (memory) | Conference | 10416 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Siala | 1 | 73 | 37.81 |
| Barry O'Sullivan | 2 | 741 | 77.69 |