Browsing by Subject "Matchings Under Preferences"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Publication
    Open Access
    Stable formulations for the Capacitated Facility Location Problem with Customer Preferences
    (2026) Domínguez Sánchez, Concepción; Jaime Alcántara, Juan de Dios; Estadística e Investigación Operativa; Facultades de la UMU::Facultad de Matemáticas
    In the Simple Plant Location Problem with Order (SPLPO), the aim is to open a subset of plants to assign every customer taking into account their preferences. Customers rank the plants in strict order and are assigned to their favorite open plant, and the objective is to minimize the location plus allocation costs. Here, we study a generalization of SPLPO named the Capacitated Facility Location Problem with Customer Preferences (CFLCP) where a limited number of customers can be allocated to each facility. We consider the global preference maximization setting, where the customers preferences are globally maximized. We define three new types of stable allocations, namely customer stable, pairwise stable and cyclic-coalition stable allocations, and we provide two mixed-integer linear formulations for each setting. In particular, our cyclic-coalition stable formulations are Pareto optimal in a global-preference maximization setting, in the sense that no customer can improve their allocation without making another one worse off. We assess the performance of the proposed formulations and the quality of the resulting stable allocations through extensive computational experiments. As an additional contribution, we present a novel formulation that provides maximum-cardinality Pareto-optimal matchings for the Capacitated House Allocation problem.