Title of article
Stable matchings and linear programming Original Research Article
Author/Authors
Hern?n Abeledo، نويسنده , , Yosef Blum، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
13
From page
321
To page
333
Abstract
This paper continues the work of Abeledo and Rothblum, who study nonbipartite stable matching problems from a polyhedral perspective. We establish here additional properties of fractional stable matchings and use linear programming to obtain an alternative polynomial algorithm for solving stable matching problems.
Journal title
Linear Algebra and its Applications
Serial Year
1996
Journal title
Linear Algebra and its Applications
Record number
821805
Link To Document