On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
Published Online:1 May 1987https://doi.org/10.1287/moor.12.2.255
- Cited by
- 28 December 2022 | Mining Technology, Vol. 132, No. 1
- 6 June 2019 | Transactions in GIS, Vol. 23, No. 4
- International Journal of Fatigue, Vol. 112
- 10 October 2013 | Knowledge and Information Systems, Vol. 42, No. 2
- Computational Materials Science, Vol. 34, No. 4
- 21 December 2017 | Journal of the Operational Research Society, Vol. 54, No. 8
- Advances in Computational Mathematics, Vol. 2, No. 4
Volume 12, Issue 2
May 1987
Pages 185-376
Article Information
Metrics
Information
- Published Online:May 01, 1987
© 1987 INFORMS
Cite as
Zvi Drezner, Saharon Shelah, (1987) On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem. Mathematics of Operations Research 12(2):255-261.
https://doi.org/10.1287/moor.12.2.255
Keywords
