A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Revisiting several problems and algorithms in continuous location with ℓ_p norms
[article]
2013
arXiv
pre-print
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>
arXiv:1312.7473v1
fatcat:6kftlishjbedxngz6vm6tjr7xa