Courtship and linear programming
type: Item
instance of: scholarly article
title: Courtship and linear programming
zbMATH Open document ID: 0821.90079
DOI: 10.1016/0024-3795(93)00122-G
author: Hernán G. Abeledo
author: Uriel G. Rothblum
published in: Linear Algebra and its Applications
publication date: 1995-05-11T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 753885
zbMATH Keywords: Gale-Shapley algorithm
zbMATH Keywords: stable matchings
zbMATH Keywords: stable marriage problems
zbMATH Keywords: dual simplex
Wikidata QID: Q114852066
MaRDI profile type: Publication
cites work: Q3998396
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Some remarks on the stable matching problem
cites work: College Admissions and the Stability of Marriage
cites work: Q3995616
cites work: Q4130997
cites work: Stable marriage assignment for unequal sets
cites work: Q3999327
cites work: Characterization of stable matchings as extreme points of a polytope
cites work: Linear programming brings marital bliss
description: scientific article; zbMATH DE number 753885