Article
Revisiting several problems and algorithms in continuous location with lp norms
Author/s | Blanco Izquierdo, Víctor
Puerto Albandoz, Justo El-Haj Ben-Ali, Safae |
Department | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Publication Date | 2014-07 |
Deposit Date | 2016-09-06 |
Published in |
|
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 ... 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. |
Project ID. | FQM-5849
MTM2010-19576-C02-01 FQM-343 |
Citation | 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Revisiting several problems and ... | 268.9Kb | [PDF] | View/ | |