Charles Prud'homme

Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem

The Robust Stable Matching (RSM) problem involves finding a stable matching that allows getting another stable matching within a minimum number of changes when a pair becomes forbidden. It has been shown that such a problem is NP-Hard. In this paper, we enrich the mathematical model for the RSM prob…