A polynomial time algorithm for a hemispherical minimax location problem

A polynomial time algorithm for a hemispherical minimax location problem

0.00 Avg rating0 Votes
Article ID: iaor20003324
Country: Netherlands
Volume: 24
Issue: 1/2
Start Page Number: 57
End Page Number: 63
Publication Date: Feb 1999
Journal: Operations Research Letters
Authors: , ,
Keywords: minimax problem
Abstract:

A polynomial time algorithm to obtain an exact solution for the equiweighted minimax location problem when the demand points are spread over a hemisphere is presented. It is shown that the solution of the minimax problem when the norm under consideration is geodesic is equivalent to solving a maximization problem using the Euclidean norm.

Reviews

Required fields are marked *. Your email address will not be published.