Repositorio de producción científica de la Universidad de Sevilla

Revisiting several problems and algorithms in continuous location with lp norms

 

Advanced Search
 
Opened Access Revisiting several problems and algorithms in continuous location with lp norms
Cites

Show item statistics
Icon
Export to
Author: Blanco Izquierdo, Víctor
Puerto Albandoz, Justo
El-Haj Ben-Ali, Safae
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 2014-07
Published in: Computational Optimization and Applications, 58 (3), 563-595.
Document type: Article
Abstract: This paper addresses the general continuous single facility location problems in finite dimension spaces under possibly different ℓp norms in the demand points. We analyze the difficulty of this family of problems and revisit convergence properties of some well-known algorithms. The ultimate goal is to provide a common approach to solve the family of continuous ℓp ordered median location problems in dimension d (including of course the ℓp minisum or Fermat-Weber location problem for any p ≥ 1). We prove that this approach has a polynomial worse case complexity for monotone lambda weights and can be also applied to constrained and even non-convex problems.
Cite: Blanco Izquierdo, V., Puerto Albandoz, J. y El-Haj Ben-Ali, S. (2014). Revisiting several problems and algorithms in continuous location with lp norms. Computational Optimization and Applications, 58 (3), 563-595.
Size: 268.9Kb
Format: PDF

URI: http://hdl.handle.net/11441/44715

DOI: 10.1007/s10589-014-9638-z

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)