Spherical minimax location problem using the Euclidean norm: Formulation and optimization
From MaRDI portal
Publication:1804377
DOI10.1007/BF01299160zbMath0820.90063MaRDI QIDQ1804377
Publication date: 14 September 1995
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Cartesian coordinate systemcoupled nonlinear equationsKarush-Kuhn-Tucker necessary optimality conditionsfactored secant updateminimax spherical locationspherical arc distance measures
Related Items (3)
Solution of an equiweighted minimax location problem on a hemisphere ⋮ Applications of second-order cone programming ⋮ A polynomial time algorithm for a hemispherical minimax location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal location on a sphere
- An efficient algorithm for solving area-constrained location problems on a sphere
- Algorithms for some minimax problems
- Minimax and maximin facility location problems on a sphere
- Location Dominance on Spherical Surfaces
- Facility Location on a Sphere
- Technical Note—On Location Dominance on Spherical Surfaces
- Domain Approximation Method for Solving Multifacility Location Problems on a Sphere
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Constrained Large-Region Multifacility Location Problems
This page was built for publication: Spherical minimax location problem using the Euclidean norm: Formulation and optimization