Polyhedral Aspects of Stable Marriage
From MaRDI portal
Publication:5244861
DOI10.1287/moor.2013.0616zbMath1308.90107MaRDI QIDQ5244861
Ioannis Mourtos, Dimitrios Magos, Pavlos Eirinakis, Panayiotis Miliotis
Publication date: 31 March 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2013.0616
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Popularity, Mixed Matchings, and Self-Duality, Review of the theory of stable matchings and contract systems, The stable \(b\)-matching polytope revisited, The diameter of the stable marriage polytope: bounding from below, Stable allocations and partially ordered sets, On Vertices and Facets of Combinatorial 2-Level Polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- Stable matchings and linear inequalities
- Courtship and linear programming
- On the stable marriage polytope
- Canonical monotone decompositions of fractional stable matchings
- Stable matchings and linear programming
- The Geometry of Fractional Stable Matchings and Its Applications
- The Complexity of Counting Stable Marriages
- Three Fast Algorithms for Four Problems in Stable Marriage
- The polynomial solvability of convex quadratic programming
- Stable Matchings, Optimal Assignments, and Linear Programming
- Of Stable Marriages and Graphs, and Strategy and Polytopes
- Stable marriage assignment for unequal sets
- The Transitive Reduction of a Directed Graph
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
