Pages that link to "Item:Q975759"
From MaRDI portal
The following pages link to Keeping partners together: Algorithmic results for the hospitals/residents problem with couples (Q975759):
Displaying 24 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Modelling practical placement of trainee teachers to schools (Q301931) (← links)
- Matching couples with Scarf's algorithm (Q314433) (← links)
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Stable matchings of teachers to schools (Q329714) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- A note of reduced dimension optimization algorithm of assignment problem (Q887868) (← links)
- A two-stage method for member selection of emergency medical service (Q887872) (← links)
- Finding all stable matchings with couples (Q908185) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Equivalence of two-sided stable matching (Q1631687) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Three-dimensional stable matching with hybrid preferences (Q1740420) (← links)
- Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
- Three-sided matching problem with mixed preferences (Q2060065) (← links)
- Stable matching of student-groups to dormitories (Q2140313) (← links)
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems (Q2167893) (← links)
- Refugee allocation in the setting of hedonic games (Q2290371) (← links)
- Matching with couples: a multidisciplinary survey (Q2854007) (← links)
- Stable matching with couples (Q5406236) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Complexity of stability in trading networks (Q6052977) (← links)
