Popular matchings in the Capacitated Facility Location Problem with Customer Preferences

P. Segura Martínez, C. Domínguez Sánchez

Let us consider a set of locations or facilities, and a set of customers who rank the facilities according to their preferences. In the Capacitated Facility Location Problem with Customer Preferences, the aim is to select a set of facilities to be opened and assign customers to them, taking into account that a limited number of customers can be allocated to each facility and considering a global preference maximization setting. In this talk, we consider customer assignments inspired by preference matching literature, more specifically based on popular matchings in the Capacitated House Allocation problem. We propose mathematical models that incorporate structural properties of popular matchings for both the case without ties and when ties arise in customer preference lists. Some computational experiments are provided.

Keywords: Popular matchings, facility location, customer preferences, mathematical formulations

GT GELOCA V: Location and routing with preferences
September 5, 2026  4:00 PM
Aula B

J. A. Aledo, C. Domínguez Sánchez, J. D. Jaime-Alcántara, M. Landete

J. Á. Aledo Sánchez, C. Domínguez Sánchez, J. D. Jaime Alcántara, M. Landete Ruiz

H. I. Calvete, C. Galé, A. Hernández, J. A. Iranzo