{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:03:01Z","timestamp":1783666981407,"version":"3.55.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T00:00:00Z","timestamp":1616803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T00:00:00Z","timestamp":1616803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00291-021-00626-z","type":"journal-article","created":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T02:02:47Z","timestamp":1616810567000},"page":"577-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The obnoxious facilities planar p-median problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Pawel","family":"Kalczynski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zvi","family":"Drezner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"626_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/trsc.28.1.70","volume":"28","author":"Y Aneja","year":"1994","unstructured":"Aneja Y, Parlar M (1994) Algorithms for Weber facility location in the presence of forbidden regions and\/or barriers to travel. Transp Sci 28:70\u201376","journal-title":"Transp Sci"},{"key":"626_CR2","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1057\/palgrave.jors.2602422","volume":"59","author":"AP Antunes","year":"2008","unstructured":"Antunes AP, Teixeira J, Coutinho M (2008) Managing solid waste through discrete location analysis: a case study in central Portugal. J Oper Res Soc 59:1038\u20131046","journal-title":"J Oper Res Soc"},{"key":"626_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/8685","volume-title":"Voronoi diagrams and delaunay triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer F, Klein R, Lee D-T (2013) Voronoi diagrams and delaunay triangulations. World Scientific, New Jersey"},{"key":"626_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/opre.36.1.84","volume":"36","author":"R Batta","year":"1988","unstructured":"Batta R, Chiu S (1988) Optimal obnoxious paths on a network: transportation of hazardous materials. Oper Res 36:84\u201392","journal-title":"Oper Res"},{"key":"626_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/trsc.23.1.26","volume":"23","author":"R Batta","year":"1989","unstructured":"Batta R, Ghose A, Palekar U (1989) Locating facilities on the Manhattan metric with arbitrarily shaped barriers and convex forbidden regions. Transp Sci 23:26\u201336","journal-title":"Transp Sci"},{"key":"626_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/trsc.24.1.77","volume":"24","author":"O Berman","year":"1990","unstructured":"Berman O, Simchi-Levi D (1990) The conditional location problem on networks. Transp Sci 24:77\u201378","journal-title":"Transp Sci"},{"key":"626_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20408","volume":"58","author":"O Berman","year":"2011","unstructured":"Berman O, Drezner Z, Krass D (2011) Big segment small segment global optimization algorithm on networks. Networks 58:1\u201311","journal-title":"Networks"},{"key":"626_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N, Taillard E (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper Res 48:444\u2013460","journal-title":"Oper Res"},{"key":"626_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0377-2217(94)00297-5","volume":"90","author":"S Butt","year":"1996","unstructured":"Butt S, Cavalier T (1996) An efficient algorithm for facility location in the presence of forbidden regions. Eur J Oper Res 90:56\u201370","journal-title":"Eur J Oper Res"},{"key":"626_CR10","doi-asserted-by":"crossref","unstructured":"Calik H, Labb\u00e9 M, Yaman H (2015) p-center problems. In: Location science. Springer, pp 79\u201392","DOI":"10.1007\/978-3-319-13111-5_4"},{"key":"626_CR11","doi-asserted-by":"crossref","unstructured":"Carrizosa E, Toth B (2019) Anti-covering problems. In: Location science. Springer, pp 123\u2013141","DOI":"10.1007\/978-3-030-32177-2_6"},{"key":"626_CR12","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","volume":"36","author":"D Chen","year":"2009","unstructured":"Chen D, Chen R (2009) New relaxation-based algorithms for the optimal solution of the continuous and discrete $$p$$-center problems. Comput Oper Res 36:1646\u20131655","journal-title":"Comput Oper Res"},{"key":"626_CR13","unstructured":"Church RL, Drezner Z (2020) Review of obnoxious facilities location problems. Review"},{"key":"626_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"RL Church","year":"1978","unstructured":"Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12:107\u2013118","journal-title":"Transp Sci"},{"key":"626_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1111\/j.1538-4632.1979.tb00702.x","volume":"11","author":"RL Church","year":"1979","unstructured":"Church RL, Meadows B (1979) Location modelling using maximum service distance criteria. Geogr Anal 11:358\u2013373","journal-title":"Geogr Anal"},{"key":"626_CR16","unstructured":"CPLEX, IBM ILOG (2019) 12.10: User\u2019s Manual for CPLEX. International Business Machines Corporation, Incline Village, NV"},{"key":"626_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343","volume-title":"Network and discrete location: models, algorithms, and applications","author":"MS Daskin","year":"1995","unstructured":"Daskin MS (1995) Network and discrete location: models, algorithms, and applications. Wiley, New York"},{"key":"626_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location science","author":"MS Daskin","year":"2015","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. In: Laporte G, Nickel S, da Gama FS (eds) Location science. Springer, Berlin, pp 21\u201345"},{"key":"626_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10479-019-03343-7","volume":"287","author":"Z Drezner","year":"2020","unstructured":"Drezner Z, Drezner TD (2020) Biologically inspired parent selection in genetic algorithms. Ann Oper Res 287:161\u2013183","journal-title":"Ann Oper Res"},{"key":"626_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1287\/opre.1030.0077","volume":"52","author":"Z Drezner","year":"2004","unstructured":"Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of non-convex facility location problems. Oper Res 52:128\u2013135","journal-title":"Oper Res"},{"key":"626_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/nav.3800300211","volume":"30","author":"Z Drezner","year":"1983","unstructured":"Drezner Z, Wesolowsky GO (1983) Minimax and maximin facility location problems on a sphere. Naval Res Logist Q 30:305\u2013312","journal-title":"Naval Res Logist Q"},{"key":"626_CR22","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1111\/j.1467-9787.1995.tb01299.x","volume":"35","author":"Z Drezner","year":"1996","unstructured":"Drezner Z, Wesolowsky GO (1996) Obnoxious facility location in the interior of a planar network. J Reg Sci 35:675\u2013688","journal-title":"J Reg Sci"},{"key":"626_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2002","unstructured":"Drezner Z, Klamroth K, Sch\u00f6bel A, Wesolowsky GO (2002) The Weber problem. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, Berlin, pp 1\u201336"},{"key":"626_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cor.2007.08.004","volume":"36","author":"T Drezner","year":"2009","unstructured":"Drezner T, Drezner Z, Scott CH (2009) Location of a facility minimizing nuisance to or from a planar network. Comput Oper Res 36:135\u2013148","journal-title":"Comput Oper Res"},{"key":"626_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/net.21698","volume":"68","author":"Z Drezner","year":"2016","unstructured":"Drezner Z, Scott CH, Turner J (2016) Mixed planar and network single-facility location problems. Networks 68:271\u2013282","journal-title":"Networks"},{"key":"626_CR26","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.cor.2018.06.006","volume":"98","author":"T Drezner","year":"2018","unstructured":"Drezner T, Drezner Z, Sch\u00f6bel A (2018) The Weber obnoxious facility location model: a big arc small arc approach. Comput Oper Res 98:240\u2013250","journal-title":"Comput Oper Res"},{"key":"626_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.cor.2018.09.010","volume":"102","author":"T Drezner","year":"2019","unstructured":"Drezner T, Drezner Z, Kalczynski P (2019a) The planar multifacility collection depots location problem. Comput Oper Res 102:121\u2013129","journal-title":"Comput Oper Res"},{"key":"626_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.omega.2018.08.013","volume":"87","author":"Z Drezner","year":"2019","unstructured":"Drezner Z, Kalczynski P, Salhi S (2019b) The multiple obnoxious facilities location problem on the plane: a Voronoi based heuristic. OMEGA Int J Manag Sci 87:105\u2013116","journal-title":"OMEGA Int J Manag Sci"},{"key":"626_CR29","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.cor.2014.05.003","volume":"62","author":"HA Eiselt","year":"2015","unstructured":"Eiselt HA, Marianov V (2015) Location modeling for municipal solid waste facilities. Comput Oper Res 62:305\u2013315","journal-title":"Comput Oper Res"},{"key":"626_CR30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275\u2013291","journal-title":"Eur J Oper Res"},{"key":"626_CR31","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill PE, Murray W, Saunders MA (2005) SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev 47:99\u2013131","journal-title":"SIAM Rev"},{"key":"626_CR32","first-page":"B85","volume":"23","author":"AJ Goldman","year":"1975","unstructured":"Goldman AJ, Dearing PM (1975a) Concepts of optimal location for partially noxious facilities. Bull Oper Res Soc Am 23:B85","journal-title":"Bull Oper Res Soc Am"},{"key":"626_CR33","volume-title":"Concepts of optimal location for partially noxious facilities","author":"AJ Goldman","year":"1975","unstructured":"Goldman AJ, Dearing PM (1975b) Concepts of optimal location for partially noxious facilities. ORSA\/TIMS NationalMeeting, Chicago"},{"key":"626_CR34","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00003-5","volume":"20","author":"HW Hamacher","year":"1997","unstructured":"Hamacher HW, Sch\u00f6bel A (1997) A note on center problems with forbidden polyhedra. Oper Res Lett 20:165\u2013169","journal-title":"Oper Res Lett"},{"key":"626_CR35","first-page":"299","volume":"3","author":"P Hansen","year":"1981","unstructured":"Hansen P, Peeters D, Thisse J-F (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299\u2013317","journal-title":"Sistemi Urbani"},{"key":"626_CR36","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0966-8349(95)00017-8","volume":"3","author":"P Hansen","year":"1995","unstructured":"Hansen P, Jaumard B, Krau S (1995) An algorithm for Weber\u2019s problem on the sphere. Loc Sci 3:217\u2013237","journal-title":"Loc Sci"},{"key":"626_CR37","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"626_CR38","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0377-2217(81)90203-4","volume":"6","author":"I Katz","year":"1981","unstructured":"Katz I, Cooper L (1981) Facility location in the presence of forbidden regions i: Formulation and the case of Euclidean distance with one forbidden circle. Eur J Oper Res 6:166\u2013173","journal-title":"Eur J Oper Res"},{"key":"626_CR39","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584989","volume":"3","author":"RE Kuenne","year":"1972","unstructured":"Kuenne RE, Soland RM (1972) Exact and approximate solutions to the multisource Weber problem. Math Program 3:193\u2013209","journal-title":"Math Program"},{"key":"626_CR40","first-page":"219","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee DT, Schachter BJ (1980) Two algorithms for constructing a Delaunay triangulation. Int J Parallel Prog 9:219\u2013242","journal-title":"Int J Parallel Prog"},{"key":"626_CR41","volume-title":"Facilities location: models and methods","author":"RF Love","year":"1988","unstructured":"Love RF, Morris JG, Wesolowsky GO (1988) Facilities location: models and methods. North Holland, New York"},{"key":"626_CR42","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/net.3230100307","volume":"10","author":"E Minieka","year":"1980","unstructured":"Minieka E (1980) Conditional centers and medians on a graph. Networks 10:265\u2013272","journal-title":"Networks"},{"key":"626_CR43","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1020723818980","volume":"110","author":"W Ogryczak","year":"2002","unstructured":"Ogryczak W, Zawadzki M (2002) Conditional median: a parametric solution concept for location problems. Ann Oper Res 110:167\u2013181","journal-title":"Ann Oper Res"},{"key":"626_CR44","first-page":"306","volume":"27","author":"T Ohya","year":"1984","unstructured":"Ohya T, Iri M, Murota K (1984) Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. J Oper Res Soc Jpn 27:306\u2013337","journal-title":"J Oper Res Soc Jpn"},{"key":"626_CR45","series-title":"Wiley Series in Probability and Statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013","volume-title":"Spatial tessellations: concepts and applications of Voronoi diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley Series in Probability and Statistics. Wiley, Hoboken"},{"key":"626_CR46","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","volume":"2","author":"CS ReVelle","year":"1970","unstructured":"ReVelle CS, Swain RW (1970) Central facilities location. Geogr Anal 2:30\u201342","journal-title":"Geogr Anal"},{"key":"626_CR47","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cor.2009.03.031","volume":"37","author":"A Sch\u00f6bel","year":"2010","unstructured":"Sch\u00f6bel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115\u2013122","journal-title":"Comput Oper Res"},{"key":"626_CR48","doi-asserted-by":"crossref","unstructured":"Shamos M, Hoey D (1975) Closest-point problems. In: Proceedings 16th Annual Symposium on the Foundations of Computer Science, Berkeley, CA, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"key":"626_CR49","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/5.163412","volume":"80","author":"K Sugihara","year":"1992","unstructured":"Sugihara K, Iri M (1992) Construction of the voronoi diagram for one million generators in single-precision arithmetic. Proc IEEE 80:1471\u20131484","journal-title":"Proc IEEE"},{"key":"626_CR50","doi-asserted-by":"crossref","unstructured":"Suzuki A (2019) Big triangle small triangle method for the Weber problem on the sphere. In: Eiselt HA, Marianov V (eds) Contributions to Location Analysis\u2014In Honor of Zvi Drezner\u2019s 75th Birthday. Springer, pp 109\u2013123","DOI":"10.1007\/978-3-030-19111-5_4"},{"key":"626_CR51","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-1-4612-5355-6_7","volume-title":"Facility location: a survey of applications and methods","author":"A Suzuki","year":"1995","unstructured":"Suzuki A, Okabe A (1995) Using Voronoi diagrams. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, New York, pp 103\u2013118"},{"key":"626_CR52","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1515\/crll.1908.134.198","volume":"134","author":"G Vorono\u00ef","year":"1908","unstructured":"Vorono\u00ef G (1908) Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. deuxi\u00e8me m\u00e9moire. recherches sur les parall\u00e9llo\u00e8dres primitifs. J Reine Angew Math 134:198\u2013287","journal-title":"J Reine Angew Math"},{"key":"626_CR53","unstructured":"Weber A (1909) \u00dcber den Standort der Industrien, 1. Teil: Reine Theorie des Standortes. English Translation: on the Location of Industries. University of Chicago Press, Chicago, IL. Translation published in 1929"},{"key":"626_CR54","first-page":"5","volume":"1","author":"GO Wesolowsky","year":"1993","unstructured":"Wesolowsky GO (1993) The Weber problem: history and perspectives. Loc Sci 1:5\u201323","journal-title":"Loc Sci"},{"key":"626_CR55","unstructured":"Wolfram S (2020) Mathematica, Version 12.2. Champaign, IL. https:\/\/www.wolfram.com\/mathematica"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00626-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00626-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00626-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T15:18:49Z","timestamp":1675091929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00626-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,27]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00626-z","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,27]]},"assertion":[{"value":"17 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}