A minisum location problem with regional demand considering farthest Euclidean distances

References

• F. Alizadeh and D. Goldfarb, Second order cone programming, Math. Program. 95 (2003), pp. 3–51.
   Web of Science ®Google Scholar
• A. Aly and A. Marucheck, Generalized Weber problem with rectangular regions, J. Oper. Res. Soc. 13 (1982), pp. 983–989.
   Google Scholar
• C.D. Bennet and A. Mirakhor, Optimal facility location with respect to several regions, J. Reg. Sci. 14 (1974), pp. 131–136.
   Web of Science ®Google Scholar
• S. Boyd and A. Mutapcic, Subgradient method, 2008. Available at http://see.stanford.edu/materials/lsocoee364b/02-subgrad_method_notes.pdfhttp://see.stanford.edu/materials/lsocoee364b/02-subgrad_method_notes.pdf.
   Google Scholar
• S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, New York, 2004.
   Google Scholar
• J. Brimberg and G. Wesolowsky, Note: Facility location with closest rectangular distances, Naval Res. Logist. 47 (2000), pp. 77–84.
   Web of Science ®Google Scholar
• J. Brimberg and G.O. Wesolowsky, Locating facilites by minimax relative to closest points of demand areas, Comput. Oper. Res. 29 (2002), pp. 625–636.
   Web of Science ®Google Scholar
• J. Brimberg and G. Wesolowsky, Minisum location with closest Euclidean distances, Ann. Oper. Res. 11 (2002), pp. 151–165.
   Web of Science ®Google Scholar
• E. Carrizosa, M. Munoz-Marquez, and J. Puerto, The Weber problem with regional demand, Eur. J. Oper. Res. 104 (1998), pp. 358–365.
   Web of Science ®Google Scholar
• E. Carrizosa, E. Conde, M. Munoz-Marquez, and J. Puerto, The generalized Weber problem with expected distances, RAIRO 29 (1995), pp. 35–57.
   Web of Science ®Google Scholar
• T.M. Cavalier and H.D. Sherali, Euclidean distance location-allocation problems with uniform demands over convex polygons, Transp. Sci. 20 (1986), pp. 107–116.
   Web of Science ®Google Scholar
• R. Chen, Optimal location of a single facility with circular demand areas, Comput. Math. Appl. 41 (2001), pp. 1049–1061.
   Web of Science ®Google Scholar
• L. Cooper, Heuristic methods for location-allocation problems, SIAM Rev. 6 (1964), pp. 37–53.
   Web of Science ®Google Scholar
• L. Cooper, A random locational equilibrium problem, J. Reg. Sci. 14 (1974), pp. 47–54.
   Web of Science ®Google Scholar
• I. CVX Research, CVX: Matlab software for disciplined convex programming, version 2.0., 2011. Available at http://www.cvxr.com/cvx.
   Google Scholar
• D. Dinler, M. Tural, and C. Iyigun, Location problems with demand regions, in Global Logistic Management, B. Kara, I. Sabuncuoglu, and B. Bidanda, eds., CRC Press, Boca Raton, London, New York, 2014, pp. 237–252.
   Google Scholar
• D. Dinler, M. Tural, and C. Iyigun, Heuristics for a continuous multi-facility location problem with demand regions, Comput. Oper. Res. 62 (2015), pp. 237–256.
   Web of Science ®Google Scholar
• Z. Drezner and G. Wesolowsky, Location models with groups of demand points, INFOR 38 (2000), pp. 359–372.
   Web of Science ®Google Scholar
• I. Gurobi Optimization, Gurobi optimizer reference manual, 2013. Available at http://www.gurobi.com.
   Google Scholar
• J. Jiang and Y. Xu, Minisum location problem with farthest Euclidean distances, Math. Methods Oper. Res. 64 (2006), pp. 285–308.
   Web of Science ®Google Scholar
• J. Jiang and X. Yuan, A Barzilai–Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Comput. Optim. Appl. 51 (2012), pp. 1275–1295.
   Web of Science ®Google Scholar
• M.S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, Applications of second-order cone programming, Linear Algeb. Appl. 284 (1998), pp. 193–228.
   Web of Science ®Google Scholar
• R .F. Love, A computational procedure for optimally locating a facility with respect to several rectangular regions, J. Reg. Sci. 12 (1972), pp. 233–242.
   Web of Science ®Google Scholar
• S. Nickel, J. Puerto, and A.M. Rodriguez-Chia, An approach to location models involving sets as existing facilities, Math. Oper. Res. 28 (2003), pp. 693–715.
   Web of Science ®Google Scholar
• B.T. Polyak, Minimization of unsmooth functionals, USSR Comput. Math. Math. Phys. 9 (1969), pp. 14–29.
   Google Scholar
• J. Puerto and A.M. Rodríguez-Chía, On the structure of the solution set for the single facility location problem with average distances, Math, Program. 128 (2011), pp. 373–401.
   Web of Science ®Google Scholar
• N.Z. Shor, Application of the gradient method for the solution of network transportation problems, in Scientific Seminar on Theory and Application of Cybernetics and Operations Research, Vol. 1, Ukrainian Academy of Sciences, Kiev, 1962, pp. 9–17.
   Google Scholar
• R.E. Stone, Technical note–Some average distance results, Transp. Sci. 25 (1991), pp. 83–90.
   Web of Science ®Google Scholar
• E. Weiszfeld, Sur le point par lequel la somme des distances de n points donnés est minimum, Tohoku Math. J. 43 (1937), pp. 355–386.
   Google Scholar