A globally convergent algorithm for facility location on a sphere
From MaRDI portal
Publication:1323619
DOI10.1016/0898-1221(94)90109-0zbMath0801.90072OpenAlexW2049093053MaRDI QIDQ1323619
Publication date: 1 December 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(94)90109-0
optimality conditionsgradient algorithmplanar Euclidean facility locationspherical facility location
Related Items (8)
Concepts and techniques of optimization on the sphere ⋮ On an open problem in spherical facility location ⋮ Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993 ⋮ On the spherical convexity of quadratic functions ⋮ Projections onto convex sets on the sphere ⋮ On the convergence of a modified algorithm for the spherical facility location problem ⋮ Facility location in normed linear spaces ⋮ Locational optimization problems solved through Voronoi diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal location on a sphere
- Minimization of functions having Lipschitz continuous first partial derivatives
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- Facility Location on a Sphere
- Weber's problem and weiszfeld's algorithm in general spaces
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
- Technical Note—Location Theory: A Selective Bibliography
- Link-Length Minimization in Networks
- A note on Fermat's problem
- Properties of a multifacility location problem involving euclidian distances
This page was built for publication: A globally convergent algorithm for facility location on a sphere