Stable matchings and linear programming
From MaRDI portal
Publication:1923201
DOI10.1016/0024-3795(95)00052-6zbMATH Open0858.90093OpenAlexW2022412414WikidataQ114852063 ScholiaQ114852063MaRDI QIDQ1923201FDOQ1923201
Authors: Hernán G. Abeledo, Yosef Blum 
Publication date: 7 October 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00052-6
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Individual preferences (91B08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Stable matchings and linear inequalities
- Linear programming brings marital bliss
- Title not available (Why is that?)
- Stable Matchings, Optimal Assignments, and Linear Programming
- Characterization of stable matchings as extreme points of a polytope
- An efficient algorithm for the “stable roommates” problem
- Title not available (Why is that?)
- A new fixed point approach for stable networks and stable marriages
- A characterization of graphs that ensure the existence of stable matchings
- Homotopy and crossings of systems of curves on a surface
Cited In (21)
- On a cutting plane heuristic for the stable roommates problem and its applications
- Stable Matching with Uncertain Linear Preferences
- On stable matchings and flows
- Compromises and rewards: stable and non-manipulable probabilistic matching
- On the set of many-to-one strongly stable fractional matchings
- Stable matching: An integer programming approach
- On the stable \(b\)-matching polytope.
- Stable Matchings, Optimal Assignments, and Linear Programming
- Stable matchings and linear inequalities
- Disjoint stable matchings in linear time
- Blockers and antiblockers of stable matchings
- Perfect matching interdiction problem restricted to a stable vertex
- Jointly stable matchings
- Linear programming brings marital bliss
- Polyhedral aspects of stable marriage
- Stable matching with network externalities
- The stable \(b\)-matching polytope revisited
- The geometry of fractional stable matchings and its applications
- A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
- An elementary integrality proof of Rothblum's stable matching formulation
- Title not available (Why is that?)
This page was built for publication: Stable matchings and linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923201)
