Courtship and linear programming
From MaRDI portal
Publication:1805218
DOI10.1016/0024-3795(93)00122-GzbMath0821.90079WikidataQ114852066 ScholiaQ114852066MaRDI QIDQ1805218
Uriel G. Rothblum, Hernán G. Abeledo
Publication date: 11 May 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
Blockers and antiblockers of stable matchings, Paths to marriage stability, An extendable stable matching algorithm of a kind of bipartite graph, Vacancy chains and equilibration in senior-level labor markets, Canonical monotone decompositions of fractional stable matchings, On the stable \(b\)-matching polytope., Deferred acceptance algorithms: history, theory, practice, and open questions, On the set of many-to-one strongly stable fractional matchings, The stable \(b\)-matching polytope revisited, Polyhedral Aspects of Stable Marriage
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the stable matching problem
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- New Finite Pivoting Rules for the Simplex Method
- Stable marriage assignment for unequal sets
- College Admissions and the Stability of Marriage
