Ordered p-median problems with neighbourhoods Blanco Izquierdo, Víctor Facility location Mixed integer second order cone programming Neighborhoods Ordered median In this paper, we introduce a new variant of the p-median facility location problem in which it is assumed that the exact location of the potential facilities is unknown. Instead, each of the facilities must be located in a region around their initially assigned location (the neighborhood). In this problem, two main decisions have to be made simultaneously: the determination of the potential facilities that must be open to serve the customers’ demand and the location of the open facilities in their neighborhoods, at global minimum cost. We present several mixed integer non-linear programming formulations for a wide family of objective functions which are common in Location Analysis: ordered median functions. We also develop two math-heuristic approaches for solving the problem. We report the results of extensive computational experiments. 2024-01-22T08:38:47Z 2024-01-22T08:38:47Z 2019-02 journal article Published version: Computational Optimization and Applications 73(2), p 603-645. https://doi.org/10.1007/s10589-019-00077-x https://hdl.handle.net/10481/87036 10.1007/s10589-019-00077-x eng http://creativecommons.org/licenses/by-nc-nd/4.0/ open access Attribution-NonCommercial-NoDerivatives 4.0 Internacional Springer