There is a recent line of research on computing stable matchings through integer programming methods for two-sided matching markets. That is the case for the hospital–resident problem with couples [1]}, ties [2]}, [3]}, college admissions with special features [4]}, stable project allocation under distributional constraints [5]}, and car–sharing [6]}. For the algorithmic aspects of matching problems under preferences we refer to the book by [7]}.
