Publication:
Stable formulations for the Capacitated Facility Location Problem with Customer Preferences

Simple item page
dc.contributor.authorDomínguez Sánchez, Concepción
dc.contributor.authorJaime Alcántara, Juan de Dios
dc.contributor.departmentEstadística e Investigación Operativa
dc.contributor.otherFacultades de la UMU::Facultad de Matemáticas
dc.date.accessioned2026-05-14T09:51:49Z
dc.date.available2026-05-14T09:51:49Z
dc.date.issued2026
dc.description.abstractIn 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.
dc.formatapplication/pdf
dc.format.extent35
dc.identifier.urihttp://hdl.handle.net/10201/231862
dc.languageeng
dc.relationAll the authors acknowledge financial support through the grant RED2022-134149-T funded by MICIU/AEI/10.13039/501100011033 (Thematic Network on Location Science and Related Problems).
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectLocation With Preferences
dc.subjectCapacitated Facility Location
dc.subjectStable Matchings
dc.subjectCombinatorial Optimization
dc.subjectMatchings Under Preferences
dc.subject.odsObjetivo 16: Paz y justicia
dc.titleStable formulations for the Capacitated Facility Location Problem with Customer Preferences
dc.typeinfo:eu-repo/semantics/preprint
dc.type.versioninfo:eu-repo/semantics/submittedVersion
dspace.entity.typePublicationes
relation.isAuthorOfPublication7def9d87-68e7-45d4-bf1f-bb994bd2608e
relation.isAuthorOfPublication979401f5-8cd0-404c-9735-0e4e67bef6d0
relation.isAuthorOfPublication.latestForDiscovery7def9d87-68e7-45d4-bf1f-bb994bd2608e
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Stable_formulations_for_the_Capacitated_Facility_Location_Problem_with_Customer_Preferences.pdf
Size:
426.41 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.37 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Artículos