M. Martínez Antón, V. Blanco
One of the foundational problems in facility location is the Weber problem. Given a set of points, the goal is to find another point minimizing the weighted sum of the lp distances to the given points. A generalized version of the Weber problem is the single-facility Continuous Ordered Median Location Problem (COMP). Given weights, in the COMP, the distances from the points to the new point are sorted in non decreasing order, and the weights are assigned to the sorted sequence of distances. This unified framework allows, by adequately choosing the weights, to model different problem of interest, as constructing the point minimizing the maximum of the distances, the sum of the m largest distances, and many other measures. In case the weights are nonnegative and non decreasing, it is known that this problem is a conic problem. Hence, it can be formulated as a p-order cone program. The goal of this work is to prove novel bounds on the complexity of problems as this one.
Palabras clave: p-order cone, semidefinite programming, computational complexity, continuous ordered median location problem
Programado
Localización (GELOCA4)
13 de junio de 2025 11:00
Sala 3. Maria Rúbies Garrofé