  This paper develops an integer programming approach to two-sided many-to-one
matching by investigating stable integral matchings of a fictitious market
where each worker is divisible. We show that stable matchings exist in a
discrete matching market when firms' preference profile satisfies a total
unimodularity condition that is compatible with various forms of
complementarities. We provide a class of firms' preference profiles that
satisfy this condition.
