 Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ normsVictor Blanco (), Justo Puerto () and Safae El Haj Ben Ali () Computational Optimization and Applications, 2014, vol. 58, issue 3, 563-595 Abstract: This paper addresses the general continuous single facility location problems in finite dimension spaces under possibly different $$\ell _\tau $$ ℓ τ norms, $$\tau \ge 1$$ τ ≥ 1 , 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 $$\ell _\tau $$ ℓ τ ordered median location problems Nickel and Puerto (Facility location: a unified approach, 2005 ) in dimension $$d$$ d (including of course the $$\ell _\tau $$ ℓ τ minisum or Fermat-Weber location problem for any $$\tau \ge 1$$ τ ≥ 1 ). We prove that this approach has a polynomial worst case complexity for monotone lambda weights and can be also applied to constrained and even non-convex problems. Copyright Springer Science+Business Media New York 2014 Keywords: Continuous location; Ordered median problems; Semidefinite programming; Moment problem; 90B85; 90C22; 65K05; 12Y05; 46N10 (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:58:y:2014:i:3:p:563-595 Ordering information: This journal article can be ordered from DOI: 10.1007/s10589-014-9638-z Access Statistics for this article Computational Optimization and Applications is currently edited by William W. Hager More articles in Computational Optimization and Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.