The following pages link to (Q4475634):
Displaying 12 items.
- Stable marriage with covering constraints -- a complete computational trichotomy (Q681890) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Constraint models for graceful graphs (Q2267806) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Finding all stable pairs and solutions to the many-to-many stable matching problem (Q2815443) (← links)
- From Marriages to Coalitions: A Soft CSP Approach (Q5191403) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)