Please use this identifier to cite or link to this item:
|Title: ||A Local Search Algorithm for SMTI and its extension to HRT Problems|
|Authors: ||Munera, Danny|
|Issue Date: ||16-Apr-2015|
|Abstract: ||Hospitals/Residents with Ties (HRT) forms a class of problems
with many applications, some of which are of considerable size. Solving
these problems has been shown to be NP-hard. In previous work, we developed
a local search algorithm which displays very high performance in
solving Stable Matching with Ties and Incomplete lists (SMTI) problems.
In this paper, we propose a method to tackle HRT problems with a slightly
modified version of our SMTI solver. We describe our method and provide
an initial performance assessment, which turns out to show that the resulting
solver can deal with significant HRT problems, providing optimal
solutions in most cases, in a very short time.|
|Appears in Collections:||INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.