We are not aware of a previous IP implementation for SRI, but there are formulations for other matching problems in the literature. Rothblum [1]} wrote a linear programming formulation for stable marriage with incomplete lists - a problem similar to SRI, except that agents are divided into two groups and they only find agents in the other group acceptable - which Abeledo and Rothblum [2]} note works for SR as it is written for a (not necessarily bipartite) graph. Gusfield and Irving wrote a formulation for the stable marriage problem (with complete preference lists) [3]} and Vande Vate [4]} for the optimal stable marriage, optimality having the same meaning as in the roommates case.
