Intra-facility equity in discrete and continuous p-facility location problems Blanco Izquierdo, Víctor Marín, Alfredo Puerto, Justo Facility location Fairness Equity Mixed integer linear programming We consider facility location problems with a new form of equity criterion. Demand points have preference order on the sites where the plants can be located. The goal is to find the location of the facilities minimizing the envy felt by the demand points with respect to the rest of the demand points allocated to the same plant. After defining this new envy criterion and the general framework based on it, we provide formulations that model this approach in both the discrete and the continuous framework. The problems are illustrated with examples and the computational tests reported show the potential and limits of each formulation on several types of instances. Although this article is mainly focused on the introduction, modeling and formulation of this new concept of envy, some improvements for all the formulations presented are developed, obtaining in some cases better solution times. 2023-12-01T12:59:25Z 2023-12-01T12:59:25Z 2024-02-01 info:eu-repo/semantics/article Computers & Operations Research Volume 162, 106487 [https://doi.org/10.1016/j.cor.2023.106487] https://hdl.handle.net/10481/85983 10.1016/j.cor.2023.106487 eng http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess Attribution-NonCommercial-NoDerivatives 4.0 Internacional Elsevier