Title of article
Courtship and linear programming Original Research Article
Author/Authors
Hern?n G. Abeledo، نويسنده , , Uriel G. Rothblum، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
14
From page
111
To page
124
Abstract
This paper demonstrates that the celebrated Gale-Shapley algorithm for obtaining stable matchings in stable marriage problems is essentially an application of the dual simplex method.
Journal title
Linear Algebra and its Applications
Serial Year
1995
Journal title
Linear Algebra and its Applications
Record number
821335
Link To Document