{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:08:03Z","timestamp":1777597683108,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10589-019-00163-0","type":"journal-article","created":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T08:02:36Z","timestamp":1578124956000},"page":"537-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solution methods for a min\u2013max facility location problem with regional customers considering closest Euclidean distances"],"prefix":"10.1007","volume":"75","author":[{"given":"Nazl\u0131","family":"Dolu","sequence":"first","affiliation":[]},{"given":"Umur","family":"Hast\u00fcrk","sequence":"additional","affiliation":[]},{"given":"Mustafa Kemal","family":"Tural","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,4]]},"reference":[{"key":"163_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second order cone programming. Math. Program. 95, 3\u201351 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0339-5","journal-title":"Math. Program."},{"issue":"11","key":"163_CR2","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1057\/jors.1982.209","volume":"33","author":"AA Aly","year":"1982","unstructured":"Aly, A.A., Marucheck, A.S.: Generalized Weber problem with rectangular regions. J. Oper. Res. Soc. 33(11), 983\u2013989 (1982). https:\/\/doi.org\/10.1057\/jors.1982.209","journal-title":"J. Oper. Res. Soc."},{"key":"163_CR3","doi-asserted-by":"publisher","unstructured":"Avigad, J., Donnelly, K.: Formalizing O notation in Isabelle\/HOL. In: International Joint Conference on Automated Reasoning, pp. 357\u2013371. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-25984-8_27","DOI":"10.1007\/978-3-540-25984-8_27"},{"issue":"1","key":"163_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1467-9787.1974.tb00435.x","volume":"14","author":"CD Bennett","year":"1974","unstructured":"Bennett, C.D., Mirakhor, A.: Optimal facility location with respect to several regions. J. Reg. Sci. 14(1), 131\u2013136 (1974). https:\/\/doi.org\/10.1111\/j.1467-9787.1974.tb00435.x","journal-title":"J. Reg. Sci."},{"key":"163_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1287\/educ.1053.0000","volume":"34","author":"H Benson","year":"2005","unstructured":"Benson, H., Saglam, U.: Mixed-integer second order cone programming: a survey. Tutor. Oper. Res. 34, 11 (2005). https:\/\/doi.org\/10.1287\/educ.1053.0000","journal-title":"Tutor. Oper. Res."},{"issue":"9","key":"163_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"9","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 9(9), 643\u2013647 (1979). https:\/\/doi.org\/10.1109\/TC.1979.1675432","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"163_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10589-017-9935-4","volume":"68","author":"A Berger","year":"2017","unstructured":"Berger, A., Grigoriev, A., Winokurow, A.: An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. Comput. Optim. Appl. 68(3), 661\u2013669 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9935-4","journal-title":"Comput. Optim. Appl."},{"key":"163_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00077-x","author":"V Blanco","year":"2019","unstructured":"Blanco, V.: Ordered p-median problems with neighbourhoods. Comput. Optim. Appl. (2019). https:\/\/doi.org\/10.1007\/s10589-019-00077-x","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"163_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/j.ejor.2017.04.023","volume":"262","author":"V Blanco","year":"2016","unstructured":"Blanco, V., Fern\u00e1ndez, E., Puerto, J.: Minimum spanning trees with neighborhoods: Mathematical programming formulations and solution methods. Eur. J. Oper. Res. 262(3), 863\u2013878 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2017.04.023","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"163_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10589-014-9638-z","volume":"58","author":"V Blanco","year":"2014","unstructured":"Blanco, V., Puerto, J., Ben-Ali, S.E.H.: Revisiting several problems and algorithms in continuous location with $$\\ell _p$$ norms. Comput. Optim. Appl. 58(3), 563\u2013595 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9638-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"163_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ejor.2015.10.065","volume":"250","author":"V Blanco","year":"2016","unstructured":"Blanco, V., Puerto, J., Ben-Ali, S.E.H.: Continuous multifacility ordered median location problems. Eur. J. Oper. Res. 250(1), 56\u201364 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.10.065","journal-title":"Eur. J. Oper. Res."},{"key":"163_CR12","unstructured":"Brimberg, J., Wesolowsky, G.: Note: facility location with closest rectangular distances. Naval Res. Logist. 47(1), 77\u201384 (2000). https:\/\/doi.org\/10.1002\/(SICI)1520-6750(200002)47:1<77::AID-NAV5>3.0.CO;2-#"},{"issue":"6","key":"163_CR13","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/S0305-0548(00)00106-4","volume":"29","author":"J Brimberg","year":"2002","unstructured":"Brimberg, J., Wesolowsky, G.O.: Locating facilities by minimax relative to closest points of demand areas. Comput. Oper. Res. 29(6), 625\u2013636 (2002). https:\/\/doi.org\/10.1016\/S0305-0548(00)00106-4","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"163_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1020901719463","volume":"111","author":"J Brimberg","year":"2002","unstructured":"Brimberg, J., Wesolowsky, G.O.: Minisum location with closest Euclidean distances. Ann. Oper. Res. 111(1\u20134), 151\u2013165 (2002). https:\/\/doi.org\/10.1023\/A:1020901719463","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"163_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1051\/ro\/1995290100351","volume":"29","author":"E Carrizosa","year":"1995","unstructured":"Carrizosa, E., Conde, E., Mu\u00f1oz Marquez, M., Puerto, J.: The generalized Weber problem with expected distances. RAIRO Oper. Res. 29(1), 35\u201357 (1995). https:\/\/doi.org\/10.1051\/ro\/1995290100351","journal-title":"RAIRO Oper. Res."},{"issue":"1\u20133","key":"163_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF02680563","volume":"83","author":"E Carrizosa","year":"1998","unstructured":"Carrizosa, E., Mu\u00f1oz-M\u00e1rquez, M., Puerto, J.: Location and shape of a rectangular facility in $${\\mathbb{R}}^{n}$$. Convexity properties. Math. program. 83(1\u20133), 277\u2013290 (1998). https:\/\/doi.org\/10.1007\/BF02680563","journal-title":"Convexity properties. Math. program."},{"issue":"1","key":"163_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1111\/j.1467-9787.1978.tb00530.x","volume":"18","author":"L Cooper","year":"1978","unstructured":"Cooper, L.: Bounds on the Weber problem solution under conditions of uncertainty. J. Reg. Sci. 18(1), 87\u201392 (1978). https:\/\/doi.org\/10.1111\/j.1467-9787.1978.tb00530.x","journal-title":"J. Reg. Sci."},{"key":"163_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9_1","author":"M De Berg","year":"1997","unstructured":"De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Springer. Computational Geometry (1997). https:\/\/doi.org\/10.1007\/978-3-662-03427-9_1","journal-title":"Computational Geometry"},{"issue":"3","key":"163_CR19","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1080\/10556788.2015.1121486","volume":"31","author":"D Dinler","year":"2016","unstructured":"Dinler, D., Tural, M.K.: A minisum location problem with regional demand considering farthest Euclidean distances. Optim. Meth. Softw 31(3), 446\u2013470 (2016). https:\/\/doi.org\/10.1080\/10556788.2015.1121486","journal-title":"Optim. Meth. Softw"},{"key":"163_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.cor.2014.09.001","volume":"62","author":"D Dinler","year":"2015","unstructured":"Dinler, D., Tural, M.K., Iyigun, C.: Heuristics for a continuous multi-facility location problem with demand regions. Comput. Oper. Res. 62, 237\u2013256 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.09.001","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"163_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1080\/07408170108936860","volume":"38","author":"Z Drezner","year":"2000","unstructured":"Drezner, Z., Wesolowsky, G.O.: Location models with groups of demand points. Inf. Syst. Oper. Res. 38(4), 359\u2013372 (2000). https:\/\/doi.org\/10.1080\/07408170108936860","journal-title":"Inf. Syst. Oper. Res."},{"issue":"4","key":"163_CR22","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/s00454-009-9159-1","volume":"42","author":"E Fogel","year":"2009","unstructured":"Fogel, E., Halperin, D., Weibel, C.: On the exact maximum complexity of Minkowski sums of polytopes. Discret. Comput. Geom. 42(4), 654 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9159-1","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"163_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00186-007-0165-x","volume":"66","author":"M Gugat","year":"2007","unstructured":"Gugat, M., Pfeiffer, B.: Weber problems with mixed distances and regional demand. Math. Methods Oper. Res. 66(3), 419\u2013449 (2007). https:\/\/doi.org\/10.1007\/s00186-007-0165-x","journal-title":"Math. Methods Oper. Res."},{"key":"163_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0121015","volume-title":"Mathematical Programming at Oberwolfach II","author":"RG Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. In: Korte, B.K., Klaus, R. (eds.) Mathematical Programming at Oberwolfach II, pp. 167\u2013184. Springer, Berlin (1984). https:\/\/doi.org\/10.1007\/BFb0121015"},{"issue":"3","key":"163_CR25","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s10589-010-9392-9","volume":"51","author":"J Jiang","year":"2012","unstructured":"Jiang, J., Yuan, X.: A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand. Comput. Optim. Appl. 51(3), 1275\u20131295 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9392-9","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"163_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00186-006-0084-2","volume":"64","author":"Jl Jiang","year":"2006","unstructured":"Jiang, Jl, Xu, Y.: Minisum location problem with farthest Euclidean distances. Math. Methods Oper. Res. 64(2), 285\u2013308 (2006). https:\/\/doi.org\/10.1007\/s00186-006-0084-2","journal-title":"Math. Methods Oper. Res."},{"issue":"6","key":"163_CR27","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1287\/opre.29.6.1219","volume":"29","author":"H Juel","year":"1981","unstructured":"Juel, H.: Bounds in the generalized Weber problem under locational uncertainty. Oper. Res. 29(6), 1219\u20131227 (1981). https:\/\/doi.org\/10.1287\/opre.29.6.1219","journal-title":"Oper. Res."},{"key":"163_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"M Lobo","year":"1998","unstructured":"Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998). https:\/\/doi.org\/10.1016\/S0024-3795(98)10032-0","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"163_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1111\/j.1467-9787.1972.tb00345.x","volume":"12","author":"RF Love","year":"1972","unstructured":"Love, R.F.: A computational procedure for optimally locating a facility with respect to several rectangular regions. J. Reg.Sci. 12(2), 233\u2013242 (1972). https:\/\/doi.org\/10.1111\/j.1467-9787.1972.tb00345.x","journal-title":"J. Reg.Sci."},{"issue":"4","key":"163_CR30","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $${\\mathbb{R}}^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983). https:\/\/doi.org\/10.1137\/0212052","journal-title":"SIAM J. Comput."},{"issue":"4","key":"163_CR31","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/moor.8.4.498","volume":"8","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: The weighted Euclidean 1-center problem. Math. Oper. Res. 8(4), 498\u2013504 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.498","journal-title":"Math. Oper. Res."},{"issue":"4","key":"163_CR32","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: New results on the complexity of p-centre problems. SIAM J. Comput. 12(4), 751\u2013758 (1983). https:\/\/doi.org\/10.1137\/0212051","journal-title":"SIAM J. Comput."},{"issue":"1","key":"163_CR33","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/TMI.2017.2756929","volume":"37","author":"F Mesadi","year":"2017","unstructured":"Mesadi, F., Erdil, E., Cetin, M., Tasdizen, T.: Image segmentation using disjunctive normal Bayesian shape and appearance models. IEEE Trans. Med. Imaging 37(1), 293\u2013305 (2017). https:\/\/doi.org\/10.1109\/TMI.2017.2756929","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"4","key":"163_CR34","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/moor.28.4.693.20521","volume":"28","author":"S Nickel","year":"2003","unstructured":"Nickel, S., Puerto, J., Rodriguez-Chia, A.M.: An approach to location models involving sets as existing facilities. Math. Oper. Res. 28(4), 693\u2013715 (2003). https:\/\/doi.org\/10.1287\/moor.28.4.693.20521","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"163_CR35","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10107-009-0308-3","volume":"128","author":"J Puerto","year":"2011","unstructured":"Puerto, J., Rodr\u00edguez-Ch\u00eda, A.M.: On the structure of the solution set for the single facility location problem with average distances. Math. Program. 128(1\u20132), 373\u2013401 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0308-3","journal-title":"Math. Program."},{"key":"163_CR36","doi-asserted-by":"publisher","unstructured":"Shamos, M.I., Hoey, D.: Geometric intersection problems. In: 17th Annual Symposium on Foundations of Computer Science (sfcs 1976), pp. 208\u2013215. IEEE (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.16","DOI":"10.1109\/SFCS.1976.16"},{"issue":"1","key":"163_CR37","first-page":"79","volume":"1","author":"JJ Sylvester","year":"1857","unstructured":"Sylvester, J.J.: A question in the geometry of situation. Q. J. Pure Appl. Math. 1(1), 79\u201380 (1857)","journal-title":"Q. J. Pure Appl. Math."},{"issue":"1","key":"163_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. Siam Rev. 57(1), 3\u201357 (2015). https:\/\/doi.org\/10.1137\/130915303","journal-title":"Siam Rev."},{"key":"163_CR39","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science, pp. 359\u2013370. Springer, Berlin (1991)"},{"issue":"1","key":"163_CR40","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800180107","volume":"18","author":"GO Wesolowsky","year":"1971","unstructured":"Wesolowsky, G.O., Love, R.: Location of facilities with rectangular distances among point and area destinations. Naval Res. Logist. Q. 18(1), 83\u201390 (1971). https:\/\/doi.org\/10.1002\/nav.3800180107","journal-title":"Naval Res. Logist. Q."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00163-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00163-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00163-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:41:50Z","timestamp":1609634510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00163-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,4]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00163-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,4]]},"assertion":[{"value":"14 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}