Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization
January 2015
MuneraDARSC:2015:AAAI
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.
In proceedings
Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat and
Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)
-
AAAI
-
-
-
-
-
-
http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9506
Export formats
Danny Munera and Daniel Diaz and Salvador Abreu and Francesca Rossi and Vijay Saraswat and, Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization, , Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), AAAI, (http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9506), January 2015.
Danny Munera, Daniel Diaz, <a href="/people/members/view.php?code=e927e6f7f16b0d293c89324129b1ea0e" class="author">Salvador Abreu</a>, Francesca Rossi and Vijay Saraswat and, <b>Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization</b>, <u>Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)</u>, AAAI, (<a href="http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9506" target="_blank">url</a>), January 2015.
@inproceedings {MuneraDARSC:2015:AAAI, author = {Danny Munera and Daniel Diaz and Salvador Abreu and Francesca Rossi and Vijay Saraswat and}, title = {Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization}, booktitle = {Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)}, publisher = {AAAI}, url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9506}, abstract = {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.}, month = {January}, year = {2015}, }
Publication's urls
/publications/view.php?code=ed1a4ad18a755358ef08e98baa0799f5
/publications/view.php?code=MuneraDARSC:2015:AAAI
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT