Author(s): Munera, Danny ; Diaz, Daniel ; Abreu, Salvador ; Rossi, Francesca ; Saraswat, Vijay ; Codognet, Philippe
Date: 2016
Persistent ID: http://hdl.handle.net/10174/17130
Origin: Repositório Científico da Universidade de Évora
Document details
Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization
Description
Stable matching problems have several practical applications. If preference lists are truncated and contain ties, finding a stable matching with maximal size is computationally difficult. We address this problem using a local search technique, based on Adaptive Search and present experimental evidence that this approach is much more efficient than state-of-the-art exact and approximate methods. Moreover, parallel versions (particularly versions with communication) improve performance so much that very large and hard instances can be solved quickly.
Document Type
Journal article
Language Portuguese
Language Portuguese
