scientific article; zbMATH DE number 2084708
From MaRDI portal
Publication:4475634
Recommendations
Cited in
(16)- ``Almost-stable matchings in the hospitals/residents problem with couples
- Stability, optimality and manipulation in matching problems with weighted preferences
- Mathematical models for stable matching problems with ties and incomplete lists
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- Stable fractional matchings
- Constraint models for graceful graphs
- Domain permutation reduction for constraint satisfaction problems
- Graph matching problems and the NP-hardness of sortedness constraints
- Finding all stable pairs and solutions to the many-to-many stable matching problem
- A Constraint Programming Approach to the Hospitals / Residents Problem
- Compact Preference Representation in Stable Marriage Problems
- Solving stable matching problems using answer set programming
- From Marriages to Coalitions: A Soft CSP Approach
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- A constraint programming approach for the premarshalling problem
- Stable marriage with covering constraints -- a complete computational trichotomy
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475634)