Stable matchings and linear inequalities

DOI10.1016/0166-218X(94)90130-9zbMath0820.90090OpenAlexW1977846486MaRDI QIDQ1336634

Uriel G. Rothblum, Hernán G. Abeledo

Publication date: 3 November 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90130-9

zbMATH Keywords

stable marriage problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the diameter of lattice polytopes, Stable matching with network externalities, Stable matchings and linear programming, On the stable \(b\)-matching polytope., Subjective homophily and the fixtures problem, Compromises and rewards: stable and non-manipulable probabilistic matching, On the set of many-to-one strongly stable fractional matchings, On a cutting plane heuristic for the stable roommates problem and its applications, Polyhedral Aspects of Stable Marriage, Popularity, Mixed Matchings, and Self-Duality, On the existence of stable roommate matchings, Pairwise kidney exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming brings marital bliss
• A characterization of graphs that ensure the existence of stable matchings
• Characterization of stable matchings as extreme points of a polytope
• An efficient algorithm for the “stable roommates” problem
• Stable Matchings, Optimal Assignments, and Linear Programming
• Integer Programming: Methods, Uses, Computations
• Maximum matching and a polyhedron with 0,1-vertices
• College Admissions and the Stability of Marriage