Article Outline
Keywords
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Blumenthal LM, Wahlin GE (1941) On the spherical surface of smallest radius enclosing a bounded subset of n‑dimensional Euclidean space. Amer Math Soc Bull 47:771–777
Boffey TB, Karkazis J (1983) Speeding up the Elzinga-Hearn algorithm for finding 1-centres. J Oper Res Soc 34:1119–1121
Chakraborty RK, Chaudhuri PK (1981) A note on geometrical solutions for some minimax location problems. Trans Sci 15:164–166
Charalambous C (1981) An iterative algorithm for the minimax multifacility location problem with Euclidean distance. Naval Res Logist Quart 28:325–337
Chrystal G (1885) On the problem to construct the minimum circle enclosing n given points in the plane. Proc Edinburgh Math Soc 3:30–33
Drezner Z, Shelah G (1987) On the complexity of the Elzinga–Hearn algorithm for the 1-center problem. Math Oper Res 12:255–261
Drezner Z, Wesolowsky GO (1983) Minimax and maximin facility location problems on a sphere. Naval Res Logist Quart 30:305–312
Elzinga J, Hearn DW (1972) Geometrical solutions for some minimax location problems. Trans Sci 6:379–394
Elzinga J, Hearn DW (1972) The minimum covering sphere problem. Managem Sci 19:96–104
Elzinga J, Hearn DW (1974) The minimum sphere covering a convex polyhedron. Naval Res Logist Quart 21:715–718
Francis RL, McGinnis LF Jr, White JA (1992) Facility and location: An analytical approach, 2nd edn. Prentice-Hall, Englewood Cliffs, NJ
Hearn DW (1971) Minimum covering spheres. PhD Thesis Johns Hopkins Univ.,).
Hearn DW, Vijay J (1981) A geometrical solution for the weighted minimum circle problem. Res. Report ISE Dept. Univ. Florida 81(2)
Hearn DW, Vijay J (1982) Efficient algorithms for the (weighted) minimum circle problem. Oper Res 30:777–795
Hearn DW, Vijay J (1995) Codes of geometrical algorithms for the (weighted) minimum circle problem. Europ J Oper Res 80:236–237
Jacobsen SK (1981) An algorithm for the minimax Weber problem. Europ J Oper Res 6:144–148
John F (1948) Extremum problems with inequalities as subsidiary conditions. Courant Anniv. Vol. Interscience 187–204
Konno H, Yajima Y, Ban A (1994) Calculating a minimal sphere containing a polytope defined by a system of linear inequalities. Comput Optim Appl 3:181–191
Kuhn HW (1975) Nonlinear programming: A historical view. SIAM-AMS Proc 9:1–26
Kuhn HW, Tucker AW (1950) Nonlinear programming. In: Neyman J (ed) Proc. Second Berkeley Symp. Math. Statistics and Probability. Univ. Calif. Press, Berkeley, CA, pp 481–492
Lawson CL (1965) The smallest covering cone or sphere. SIAM Rev 7:415–417
Megiddo N (1983) Linear time algorithms for linear programming in R3 and related problems. SIAM J Comput 12:759–776
Nair KPK, Chandrasekaran R (1971) Optimal location of a single service center of certain types. Naval Res Logist Quart 18:503–510
Patel MH (1995) Spherical minimax location problem using the Euclidean norm: Formulation and optimization. Comput Optim Appl 4:79–90
Preparata FP, Shamos. MI (1985) Computational geometry: An introduction. Springer, Berlin
Rademacher H, Toeplitz O (1957) The enjoyment of mathematics. Princeton Univ. Press, Princeton. Transl. from: Von Zahlen and Figuren. Springer, 1933
Shamos MI, Hoey D (1975) Closest point problems. In: Proc. 16th IEEE Annual Symp., Found. of Comput. Sci., Berkeley, pp 151–162
Sylvester JJ (1857) A question in the geometry of situation. Quart J Pure Appl Math 1:79
Sylvester JJ (1860) On Poncelet's approximate linear valuation of surd froms. Philosophical Mag (Fourth Ser) 20:203–222
Welzl E (1991) Smallest enclosing disks (balls and ellipsoids). Lecture Notes Computer Sci, vol 555. Springer, Berlin, pp 359–370
Xue G, Sun S (1995) The spherical one-center problem. In: Du D-Z and Pardalos PM (eds) Minimax and Applications. Kluwer, Dordrecht, pp 153–156
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Hearn, D.W. (2008). Single Facility Location: Circle Covering Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_620
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_620
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering