Pages that link to "Item:Q1122480"
From MaRDI portal
The following pages link to Linear programming brings marital bliss (Q1122480):
Displayed 23 items.
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Stable marriages and search frictions (Q402071) (← links)
- Task assignment with controlled and autonomous agents (Q459176) (← links)
- Stable marriage with general preferences (Q506532) (← links)
- Equitable representation and recruitment (Q537577) (← links)
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- Stable multi-skill workforce assignments (Q744637) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Characterization of stable matchings as extreme points of a polytope (Q1190600) (← links)
- Stable matchings and linear inequalities (Q1336634) (← links)
- On the stable \(b\)-matching polytope. (Q1414822) (← links)
- On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- Courtship and linear programming (Q1805218) (← links)
- On the stable marriage polytope (Q1910547) (← links)
- Canonical monotone decompositions of fractional stable matchings (Q1914090) (← links)
- Stable matchings and linear programming (Q1923201) (← links)
- Bistable versions of the marriages and roommates problems (Q1970204) (← links)
- Existence of stable outcomes and the lattice property for a unified matching market (Q1974049) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
- Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
- Efficiency and stability of probabilistic assignments in marriage problems (Q5964688) (← links)