Communication Dans Un Congrès Année : 2024

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

Résumé

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 problem based on new theoretical properties. We derive from these properties new polynomial time pre-solving algorithms which both reduce the search space and speed up the exploration. We also extend our results to the instances of the Many-to-Many problem and give its corresponding constraint programming (CP) model. We show how the use of our algorithms improve the state-of-the-art results and make it possible to obtain proofs of optimality on large instances via the CP model.
Fichier non déposé

Dates et versions

hal-04716981 , version 1 (01-10-2024)

Identifiants

Citer

Sulian Le Bozec-Chiffoleau, Charles Prud'Homme, Gilles Simonin. Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem. IJCAI 2024: Thirty-Third International Joint Conference on Artificial Intelligence, Aug 2024, Jeju, South Korea. pp.2860-2867, ⟨10.24963/ijcai.2024/317⟩. ⟨hal-04716981⟩
35 Consultations
0 Téléchargements

Altmetric

Partager

More