This dataset includes all the randomly generated instances used to compare the performance of different algorithms in the paper, A Tie-Breaking Based Local Search Algorithm for Stable Matching Problem
This dataset includes all the randomly generated instances used to compare the performance of different algorithms in the paper, A Tie-Breaking Based Local Search Algorithm for Stable Matching Problem
The Hospitals / Residents problem with Couples (hrc) is a generalisation of the classical Hospitals / Residents problem (hr) that is important in practical applications because it models the case wher
The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we s