Algorithms and dimensionality reductions for continuous multifacility ordered median location problems

2014/01/04 by Víctor Blanco, Blanco, Víctor, Justo Puerto +3
Business, Management and Accounting · Computer Science · Mathematics · #12Y05 #46N10 #65K05 #90B85 #90C22 #Advanced Optimization Algorithms Research #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC) #Optimization and Variational Analysis #math.OC #msc:12Y05 #msc:46N10 #msc:65K05 #msc:90B85 #msc:90C22

paper · pdf · doi:10.48550/arxiv.1401.0817

26 pages, 2 tables

openalex publication_date 2014/01/04 · arxiv created 2014/10/19 · arxiv updated 2014/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we propose a general methodology for solving a broad class of continuous, multifacility location problems, in any dimension and with ℓ_τ-norms proposing two different methodologies: 1) by a new second order cone mixed integer programming formulation and 2) by formulating a sequence of semidefinite programs that converges to the solution of the problem; each of these relaxed problems solvable with SDP solvers in polynomial time. We apply dimensionality reductions of the problems by sparsity and symmetry in order to be able to solve larger problems.

Related

• Revisiting several problems and algorithms in continuous location with ℓ_p norms
• Solving a Continuous Multifacility Location Problem by DC Algorithms
• An exact copositive programming formulation for the Discrete Ordered Median Problem: Extended version
• A Branch-and-Price approach for the Continuous Multifacility Monotone Ordered Median Problem
• Ordered p-median problems with neighborhoods