A unified approach to multisource location problems on a sphere is presented. Euclidean, squared Euclidean and the great circle distances are considered. An algorithm is formulated and its convergence properties are investigated.
Recommendations
Cited in
(13)- A globally convergent algorithm for facility location on a sphere
- On the convergence of a modified algorithm for the spherical facility location problem
- One more well-solved case of the multifacility location problem
- Borda winner in facility location problems on sphere
- Discrete location problem on arbitrary surface in R^3
- Minimax and maximin facility location problems on a sphere
- Locating a Circle on a Sphere
- scientific article; zbMATH DE number 4043575 (Why is no real title available?)
- Interacting New Facilities and Location-Allocation Problems
- Polynomial algorithms for center location on spheres
- Total variation regularization on Riemannian manifolds by iteratively reweighted minimization
- Constrained Large-Region Multifacility Location Problems
- Facility location in normed linear spaces
This page was built for publication: Multifacility location problems on a sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095779)
