Pages that link to "Item:Q2373720"

The following pages link to Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720):

Displaying 16 items.

• A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
• Rotations in the stable \(b\)-matching problem (Q964393) (← links)
• The stable \(b\)-matching polytope revisited (Q1801060) (← links)
• Understanding the generalized median stable matchings (Q1959721) (← links)
• Faster algorithms for stable allocation problems (Q1959735) (← links)
• On the set of many-to-one strongly stable fractional matchings (Q2019364) (← links)
• Three-sided matching problem with mixed preferences (Q2060065) (← links)
• Blockers and antiblockers of stable matchings (Q2637344) (← links)
• Cycles to compute the full set of many-to-many stable matchings (Q2673686) (← links)
• Stable allocations and partially ordered sets (Q2684044) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
• Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
• Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)