Spherical Minimax Location Problem

Authors:
P. Das;N. R. Chakraborti;P. K. Chaudhuri
Affiliations:
Department of Mathematics, North Bengal University, Darjeeling, West Bengal 734430, India;Department of Mathematics, North Bengal University, Darjeeling, West Bengal 734430, India;Department of Mathematics, North Bengal University, Darjeeling, West Bengal 734430, India
Venue:
Computational Optimization and Applications
Year:
2001

Citing 5
Cited 2

An efficient geometric solution to the minimum spanning circle problem

Operations Research
Spherical minimax location problem using the euclidean norm: formulation and optimization

Computational Optimization and Applications
Solution of an equiweighted minimax location problem on a hemisphere

Computational Optimization and Applications
Computational geometry.

Computational geometry.
A polynomial time algorithm for a hemispherical minimax location problem

Operations Research Letters

Ownership protection of shape datasets with geodesic distance preservation

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A polynomial time algorithm for a hemispherical minimax location problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity.