Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal-paris1.archives-ouvertes.fr/hal-01144208
Contributor : Danny Munera Connect in order to contact the contributor
Submitted on : Tuesday, April 21, 2015 - 11:18:48 AM
Last modification on : Friday, April 29, 2022 - 10:12:49 AM
Long-term archiving on: : Wednesday, April 19, 2017 - 1:15:23 AM

File

MATCHUP15.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01144208, version 1

Citation

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⟩

Share

Metrics

Record views

170

Files downloads

282