A Local Search Algorithm for SMTI and its extension to HRT Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

A Local Search Algorithm for SMTI and its extension to HRT Problems

(1) , (1) , (2) , (3) , (4) , (5, 6)
1
2
3
4
5
6

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.
Fichier principal
Vignette du fichier
MATCHUP15.pdf (312.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01144208 , version 1 (21-04-2015)

Identifiers

  • HAL Id : hal-01144208 , version 1

Cite

Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, et al.. A Local Search Algorithm for SMTI and its extension to HRT Problems. 3rd International Workshop on Matching Under Preferences, University of Glasgow, Apr 2015, Glasgow, United Kingdom. ⟨hal-01144208⟩
174 View
287 Download

Share

Gmail Facebook Twitter LinkedIn More