Stable matchings and linear programming
type: Item
instance of: scholarly article
title: Stable matchings and linear programming
zbMATH Open document ID: 0858.90093
DOI: 10.1016/0024-3795(95)00052-6
author: Hernán G. Abeledo
author: Yosef Blum
published in: Linear Algebra and its Applications
publication date: 1996-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 91B08
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 931932
zbMATH Keywords: nonbipartite stable matching problems
zbMATH Keywords: polyhedral perspective
zbMATH Keywords: fractional stable matchings
MaRDI profile type: Publication
full work available at URL: 0024-3795(95)00052-6
OpenAlex ID: W2022412414
Wikidata QID: Q114852063
cites work: A characterization of graphs that ensure the existence of stable matchings
cites work: Stable matchings and linear inequalities
cites work: Q4198785
cites work: A new fixed point approach for stable networks and stable marriages
cites work: College Admissions and the Stability of Marriage
cites work: Q3995616
cites work: An efficient algorithm for the “stable roommates” problem
cites work: Q4130997
cites work: Q3682240
cites work: Stable Matchings, Optimal Assignments, and Linear Programming
cites work: Q4273943
cites work: Characterization of stable matchings as extreme points of a polytope
cites work: Homotopy and crossings of systems of curves on a surface
cites work: Linear programming brings marital bliss
description: scientific article; zbMATH DE number 931932