We present a fascinating model that has lately caught attention among physicists working in
complexity related fields. Though it originated from mathematics and later from economics …

Local search metaheuristics are a recognized means of solving hard combinatorial
problems. Over the last couple of decades, significant advances have been made in terms of …

Abstract The Hospitals/Residents problem with Ties is a many-to-one stable matching
problem and it has several practical applications. In this paper, we present a heuristic repair …

In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a
weakly stable matching of maximum size for the stable marriage problem with ties and …

Abstract The Hospitals/Residents with Ties Problem is a many-one stable matching problem,
in which residents need to be assigned to hospitals to meet their constraints. In this paper …

In a variant of the stable marriage problem where ties and incomplete lists are allowed,
finding a stable matching of maximum cardinality is known to be NP-hard. There are a lot of …

This paper proposes a heuristic repair algorithm to find a maximum weakly stable matching
for the stable marriage problem with ties and incomplete lists. Our algorithm is designed …

This paper proposes an approximate search algorithm to solve the student-internship
allocation problem. The key idea of the algorithm is that in each iteration, each student …

This paper proposes an approximate search algorithm to solve the student-internship
allocation problem. The key idea of the algorithm is that in each iteration, each student …

This paper presents a min-conflicts algorithm to find a maximum weakly stable matching for
the Hospitals/Residents problem with Ties (MAX-HRT). We represent the problem in terms of …