On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem

Published Online:https://doi.org/10.1287/moor.12.2.255

We show that the complexity of the Elzinga-Hearn algorithm for the 1-center (single facility minimax) problem is Ω(n2). We also show that the algorithm reaches a solution within any given accuracy in O(n) time.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.