A polynomial time algorithm for a hemispherical minimax location problem

DOI10.1016/S0167-6377(98)00047-9zbMath0956.90015OpenAlexW1966277362MaRDI QIDQ1306369

V. Pereyra

Publication date: 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00047-9

zbMATH Keywords

polynomial time algorithmgeodesic normhemisphereequiweighted minimax location

Mathematics Subject Classification ID

Continuous location (90B85)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal location on a sphere
• Spherical minimax location problem using the Euclidean norm: Formulation and optimization
• Solution of an equiweighted minimax location problem on a hemisphere
• Minimax and maximin facility location problems on a sphere
• An Efficient Geometric Solution to the Minimum Spanning Circle Problem
• 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
• An algorithm for Weber's problem on the sphere
• Constrained Large-Region Multifacility Location Problems
• Spherical minimax location problem

This page was built for publication: A polynomial time algorithm for a hemispherical minimax location problem