A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.
Issue Date
2022-06-01Keywords
3DSM-cycConstraint programming
Fairness
Three-dimensional stable matching with cyclic preferences
Metadata
Show full item recordJournal
Constraints : an international journalDOI
10.1007/s10601-022-09335-yPubMed ID
35965949PubMed Central ID
35965949Item Type
ArticleLanguage
enISSN
1383-7133ae974a485f413a2113503eed53cd6c53
10.1007/s10601-022-09335-y
Scopus Count
Collections
The following license files are associated with this item:
- Creative Commons
Related articles
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences.
- Authors: Cseh Á, Escamocher G, Quesada L
- Issue date: 2023
- "Almost-stable" matchings in the Hospitals / Residents problem with Couples.
- Authors: Manlove DF, McBride I, Trimble J
- Issue date: 2017
- Stable Matching with Uncertain Linear Preferences.
- Authors: Aziz H, Biró P, Gaspers S, de Haan R, Mattei N, Rastegari B
- Issue date: 2020
- Solving the task variant allocation problem in distributed robotics.
- Authors: Cano J, White DR, Bordallo A, McCreesh C, Michala AL, Singer J, Nagarajan V
- Issue date: 2018
- Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences.
- Authors: Alimudin A, Ishida Y
- Issue date: 2022 Feb 11