Pages that link to "Item:Q3150272"
From MaRDI portal
The following pages link to The Stable Roommates Problem with Ties (Q3150272):
Displayed 19 items.
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- When do stable roommate matchings exist? A review (Q483587) (← links)
- Win-win match using a genetic algorithm (Q611494) (← links)
- An algorithm for a super-stable roommates problem (Q650948) (← links)
- Size versus stability in the marriage problem (Q964402) (← links)
- Geometric stable roommates (Q976079) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Stable partitions with \(\mathcal W\)-preferences (Q1827807) (← links)
- The stable crews problem (Q1827831) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- On the stable \(b\)-matching problem in multigraphs (Q2476254) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- Locally Stable Marriage with Strict Preferences (Q2968513) (← links)
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability (Q3449578) (← links)
- Size Versus Stability in the Marriage Problem (Q3602826) (← links)
- Hardness results for stable exchange problems (Q5892304) (← links)
- Hardness results for stable exchange problems (Q5965780) (← links)