A location–allocation problem with concentric circles

References

• Agarwal, P.K., Aronov, B., Har-Peled, S. and Sharir, M. (2000) Approximating and exact algorithms for minimum-width annuli and shells. Discrete and Computational Geometry, 24, 687–705.
   Web of Science ®Google Scholar
• Berman, O., Drezner, Z. and Krass, D. (2011) Big segment small segment global optimization algorithm on networks. Networks, 58, 1–11.
   Web of Science ®Google Scholar
• Brimberg, J., Juel, H., Körner, M.-C. and Schöbel, A. (2011) Locating a general minisum “circle” on the plane. 4OR: A Quarterly Journal of Operations Research, 9, 351–370.
   Web of Science ®Google Scholar
• Brimberg, J., Juel, H., Körner, M.-C. and Schöbel, A. (2012) Locating an axis-parallel rectangle on a Manhattan plane. TOP, 22(1), 185–207.
   Web of Science ®Google Scholar
• Brimberg, J., Juel, H. and Schöbel, A. (2009a) Locating a circle on the plane using the minimax criterion. Studies in Location Analysis, 17, 45–60.
   Google Scholar
• Brimberg, J., Juel, H. and Schöbel, A. (2009b) Locating a minisum circle in the plane. Discrete Applied Mathematics, 157, 901–912.
   Web of Science ®Google Scholar
• Chan, T.M. (2002) Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. International Journal of Computational Geometry and Applications, 12, 67–85.
   Web of Science ®Google Scholar
• Cooper, L. (1963) Location-allocation problems. Operations Research, 11, 331–343.
   Web of Science ®Google Scholar
• Cooper, L. (1964) Heuristic methods for location-allocation problems. SIAM Review, 6, 37–53.
   Web of Science ®Google Scholar
• Drezner, Z. and Brimberg, J. (2014) Fitting concentric circles to measurements. Mathematical Methods of Operations Research, 79, 119–133.
   Web of Science ®Google Scholar
• Drezner, Z. and Nickel, S. (2009a) Constructing a DC decomposition for ordered median problems. Journal of Global Optimization, 45, 187–201.
   Web of Science ®Google Scholar
• Drezner, Z. and Nickel, S. (2009b) Solving the ordered one-median problem in the plane. European Journal of Operational Research, 195, 46–61.
   Web of Science ®Google Scholar
• Drezner, Z., Steiner, S. and Wesolowsky, G.O. (2002) On the circle closest to a set of points. Computers and Operations Research, 29, 637–650.
   Web of Science ®Google Scholar
• Drezner, Z. and Suzuki, A. (2004) The big triangle small triangle method for the solution of non-convex facility location problems. Operations Research, 52, 128–135.
   Web of Science ®Google Scholar
• Elzinga, J. and Hearn, D. (1972) Geometrical solutions for some minimax location problems. Transportation Science, 6, 379–394.
   Google Scholar
• Gluchshenko, O.N., Hamacher, H.W. and Tamir, A. (2009) An optimal o(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Operations Research Letters, 37, 168–170.
   Web of Science ®Google Scholar
• Hansen, P., Peeters, D. and Thisse, J.-F. (1981) On the location of an obnoxious facility. Sistemi Urbani, 3, 299–317.
   Google Scholar
• Hassin, R. and Tamir, A. (1991) Improved complexity bounds for location problems on the real line. Operations Research Letters, 10, 395–402.
   Web of Science ®Google Scholar
• Jeffreys, H. and Jeffreys, B.S. (1988) The Lipschitz condition, in Methods of Mathematical Physics, third edition. Cambridge University Press, Cambridge, UK.
   Google Scholar
• Körner, M.-C., Brimberg, J., Juel, H. and Schöbel, A. (2011) Geometric fit of a point set by generalized circles. Journal of Global Optimization, 51, 115–132.
   Web of Science ®Google Scholar
• Labbé, M., Laporte, G., Martin, I.R. and Gonzalez, J.J.S. (2005) Locating median cycles in networks. European Journal of Operational Research, 160, 457–470.
   Web of Science ®Google Scholar
• Lee, D.T. and Schachter, B.J. (1980) Two algorithms for constructing a Delaunay triangulation. International Journal of Parallel Programming, 9(3), 219–242.
   Google Scholar
• Love, R.F. (1976) One dimensional facility location-allocation using dynamic programming. Management Science, 22, 614–617.
   Web of Science ®Google Scholar
• Love, R.F., Morris, J.G. and Wesolowsky, G.O. (1988) Facilities Location: Models & Methods. North Holland, New York, NY.
   Google Scholar
• Megiddo, N. (1983) Linear-time algorithms for linear programming in R3 and related problems. SIAM Journal on Computing, 12, 759–776.
   Web of Science ®Google Scholar
• Nickel, S. and Puerto, J. (2005) Facility Location - A Unified Approach. Springer Verlag, Berlin.
   Google Scholar
• Nievergelt, Y. (2010) Median spheres: theory, algorithms, applications. Numerische Mathematik, 114, 573–606.
   Web of Science ®Google Scholar
• Pearce, C.E.M. (1974) Locating concentric ring roads in a city. Transportation Science, 8, 142–168.
   Google Scholar
• Plastria, F. (1992) GBSSS, the generalized big square small square method for planar single facility location. European Journal of Operational Research, 62, 163–174.
   Web of Science ®Google Scholar
• Sarkisyan, Y.L., Gupta, K.C. and Roth, B. (1973) Kinematic geometry associated with the least-square approximation of a given motion. Journal of Engineering for Industry, 95, 503–510.
   Web of Science ®Google Scholar
• Schöbel, A. and Scholz, D. (2010) The big cube small cube solution method for multidimensional facility location problems. Computers and Operations Research, 37, 115–122.
   Web of Science ®Google Scholar
• Suzuki, T. (2005) Optimal location of orbital routes in a circular city, in Proceeding of the ISOLDE X Conference, Sevilla, Spain, 2–8 June 2005.
   Google Scholar
• Tuy, H., Al-Khayyal, F. and Zhou, F. (1995) A D.C. optimization method for single facility location problems. Journal of Global Optimization, 7, 209–227.
   Web of Science ®Google Scholar