Computing relaxations for the three-dimensional stable matching problem with cyclic preferences

Constraint programming has proven to be a successful framework for determining whether a given instance of the three-dimensional stable matching problem with cyclic preferences (3dsm-cyc) admits a solution. If such an instance is satisfiable, constraint models can even compute its optimal solution f...

Descripción completa

Detalles Bibliográficos
Autores principales: Cseh, Ágnes, Escamocher, Guillaume, Quesada, Luis
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10400706/
https://www.ncbi.nlm.nih.gov/pubmed/37545838
http://dx.doi.org/10.1007/s10601-023-09346-3

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10400706/
https://www.ncbi.nlm.nih.gov/pubmed/37545838
http://dx.doi.org/10.1007/s10601-023-09346-3

Ejemplares similares