A polynomial time algorithm for a hemispherical minimax location problem
type: Item
instance of: scholarly article
title: A polynomial time algorithm for a hemispherical minimax location problem
zbMATH Open document ID: 0956.90015
DOI: 10.1016/S0167-6377(98)00047-9
author: V. Pereyra
published in: Operations Research Letters
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 1347068
zbMATH Keywords: geodesic norm
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: equiweighted minimax location
zbMATH Keywords: hemisphere
MaRDI profile type: Publication
cites work: Location Dominance on Spherical Surfaces
cites work: Constrained Large-Region Multifacility Location Problems
cites work: Spherical minimax location problem
cites work: Domain Approximation Method for Solving Multifacility Location Problems on a Sphere
cites work: Technical Note—On Location Dominance on Spherical Surfaces
cites work: Facility Location on a Sphere
cites work: Minimax and maximin facility location problems on a sphere
cites work: An algorithm for Weber's problem on the sphere
cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem
cites work: Optimal location on a sphere
cites work: Q4203976
cites work: An Efficient Geometric Solution to the Minimum Spanning Circle Problem
cites work: Spherical minimax location problem using the Euclidean norm: Formulation and optimization
cites work: Q5287180
cites work: Solution of an equiweighted minimax location problem on a hemisphere
full work available at URL: s0167-6377(98)00047-9
OpenAlex ID: W1966277362
description: scientific article; zbMATH DE number 1347068