1 research outputs found
Revisiting several problems and algorithms in continuous location with norms
This paper addresses the general continuous single facility location problems
in finite dimension spaces under possibly different 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 ordered
median location problems in dimension (including of course the
minisum or Fermat-Weber location problem for any ). 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.Comment: 31 pages, 5 table