A note on center problems with forbidden polyhedra

0.00 Avg rating—0 Votes

Article ID:	iaor19982619
Country:	Netherlands
Volume:	20
Issue:	4
Start Page Number:	165
End Page Number:	169
Publication Date:	May 1997
Journal:	Operations Research Letters
Authors:	Hamacher Horst W., Schbel Anita

Abstract:

The problem of finding an optimal location X* minimizing the maximum Euclidean distance to existing facilities is well solved by e.g. the Elzinga–Hearn algorithm. In practical situations X* will however often not be feasible. We therefore suggest in this note a polynomial algorithm which will find an optimal location X^F in a feasible subset F⊆ℝ² of the plane.

Reviews

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