A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
type: Item
instance of: scholarly article
title: A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
zbMATH Open document ID: 1498.91280
author: Ágnes Cseh
author: Guillaume Escamocher
author: Luis O. Quesada
author: Begum Genc
published in: Constraints
publication date: 2022-09-29T00:00:00Z
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7594544
zbMATH Keywords: three-dimensional stable matching with cyclic preferences
zbMATH Keywords: 3DSM-cyc
zbMATH Keywords: constraint programming
zbMATH Keywords: fairness
describes a project that uses: MiniZinc
describes a project that uses: Gecode
describes a project that uses: CHUFFED
MaRDI profile type: Publication
full work available at URL: s10601-022-09335-y
OpenAlex ID: W4282042326
cites work: The Stable Roommates Problem with Globally Ranked Pairs
cites work: Nonexistence of stable threesome matchings
cites work: A tale of two mechanisms: Student placement
cites work: Stable matching with couples
cites work: Three-sided stable matchings with cyclic preferences
cites work: Stable matchings in three-sided systems with cyclic preferences
cites work: Solving stable matching problems using answer set programming
cites work: Existence of stable matchings in some three-sided systems.
cites work: Finding all stable pairs and solutions to the many-to-many stable matching problem
cites work: Three-dimensional stable matching with cyclic preferences
cites work: Three-dimensional matching instances are rich in stable matchings
cites work: A new fixed point approach for stable networks and stable marriages
cites work: Network flow and 2-satisfiability
cites work: College Admissions and the Stability of Marriage
cites work: Q4475634
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: Q3995616
cites work: Approximability results for stable marriage problems with ties.
cites work: Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
cites work: An efficient algorithm for the “stable roommates” problem
cites work: Complexity of the sex-equal stable marriage problem
cites work: Q4130997
cites work: On the existence of three-dimensional stable matchings with cyclic preferences
cites work: Algorithmics of Matching Under Preferences
cites work: A Constraint Programming Approach to the Hospitals / Residents Problem
cites work: Sex-equal stable matchings: complexity and exact algorithms
cites work: Three-Dimensional Stabl Matching Problems
cites work: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
cites work: Q3999327
cites work: Revisiting Two-Sided Stability Constraints
cites work: A New Approach to Stable Matching Problems
cites work: Core Stability in Hedonic Coalition Formation
DOI: 10.1007/S10601-022-09335-Y
description: scientific article; zbMATH DE number 7594544