Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Roommates Problem with Globally Ranked Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Socially Stable Matchings in the Hospitals/Residents Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matching with couples / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Almost stable'' matchings in the roommates problem with bounded preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size versus stability in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-sided stable matchings with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching through institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bribery and Control in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings in three-sided systems with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of the stable roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to satisfy (almost) all roommates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable marriage problem with ties and restricted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable roommates problem with short lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instability of matchings in decentralized markets with various preference structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional stable matching with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fixed point approach for stable networks and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow and 2-satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a super-stable roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation lower bound for finding almost stable maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the sex-equal stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of three-dimensional stable matchings with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint Programming Approach to the Hospitals / Residents Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sex-equal stable matchings: complexity and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Dimensional Stabl Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional stable matching with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Two-Sided Stability Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Fractional Stable Matchings and Its Applications / rank
 
Normal rank

Latest revision as of 21:43, 2 August 2024

scientific article; zbMATH DE number 7738737
Language Label Description Also known as
English
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
scientific article; zbMATH DE number 7738737

    Statements

    Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2023
    0 references
    three-dimensional stable matching with cyclic preferences
    0 references
    3\textsc{dsm-cyc}
    0 references
    constraint programming
    0 references
    relaxation
    0 references
    almost stable matching
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers