A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences

We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of the two-dimensional stable matching problem, we are the fir...

Descripción completa

Detalles Bibliográficos
Autores principales: Cseh, Ágnes, Escamocher, Guillaume, Genç, Begüm, Quesada, Luis
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360097/
https://www.ncbi.nlm.nih.gov/pubmed/35965949
http://dx.doi.org/10.1007/s10601-022-09335-y

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360097/
https://www.ncbi.nlm.nih.gov/pubmed/35965949
http://dx.doi.org/10.1007/s10601-022-09335-y

Ejemplares similares