{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:10:56Z","timestamp":1719101456750},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"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":["Comput Manag Sci"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10287-024-00503-4","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T15:02:12Z","timestamp":1709046132000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiple obnoxious facility location: the case of protected areas"],"prefix":"10.1007","volume":"21","author":[{"given":"Malgorzata","family":"Miklas-Kalczynska","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Kalczynski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"issue":"1","key":"503_CR1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/trsc.28.1.70","volume":"28","author":"YP Aneja","year":"1994","unstructured":"Aneja YP, Parlar M (1994) Algorithms for Weber facility location in the presence of forbidden regions and\/or barriers to travel. Transp Sci 28(1):70\u201376","journal-title":"Transp Sci"},{"issue":"1","key":"503_CR2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/trsc.23.1.26","volume":"23","author":"R Batta","year":"1989","unstructured":"Batta R, Ghose A, Palekar US (1989) Locating facilities on the Manhattan metric with arbitrarily shaped barriers and convex forbidden regions. Transp Sci 23(1):26\u201336","journal-title":"Transp Sci"},{"issue":"1","key":"503_CR3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-008-0456-5","volume":"179","author":"J Bennell","year":"2010","unstructured":"Bennell J, Scheithauer G, Stoyan Y, Romanova T (2010) Tools of mathematical modeling of arbitrary object packing problems. Ann Oper Res 179(1):343\u2013368","journal-title":"Ann Oper Res"},{"issue":"7","key":"503_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1057\/palgrave.jors.2601548","volume":"54","author":"O Berman","year":"2003","unstructured":"Berman O, Drezner Z, Wesolowsky GO (2003) The expropriation location problem. J Oper Res Soc 54(7):769\u2013776","journal-title":"J Oper Res Soc"},{"issue":"1","key":"503_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2005.10.061","volume":"177","author":"M Bischoff","year":"2007","unstructured":"Bischoff M, Klamroth K (2007) An efficient solution method for Weber problems with barriers based on genetic algorithms. Eur J Oper Res 177(1):22\u201341","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"503_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0966-8349(98)00050-3","volume":"6","author":"J Brimberg","year":"1998","unstructured":"Brimberg J, Juel H (1998) A minisum model with forbidden regions for locating a semi-desirable facility in the plane. Locat Sci 6(1\u20134):109\u2013120","journal-title":"Locat Sci"},{"issue":"1","key":"503_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(94)00297-5","volume":"90","author":"SE Butt","year":"1996","unstructured":"Butt SE, Cavalier TM (1996) An efficient algorithm for facility location in the presence of forbidden regions. Eur J Oper Res 90(1):56\u201370","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2021.02.032","volume":"296","author":"T Byrne","year":"2022","unstructured":"Byrne T, Kalcsics J (2022) Conditional facility location problems with continuous demand and a polygonal barrier. Eur J Oper Res 296(1):22\u201343","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ejor.2009.04.023","volume":"202","author":"MS Canbolat","year":"2010","unstructured":"Canbolat MS, Wesolowsky GO (2010) The rectilinear distance Weber problem in the presence of a probabilistic line barrier. Eur J Oper Res 202(1):114\u2013121","journal-title":"Eur J Oper Res"},{"issue":"2","key":"503_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2011.09.006","volume":"217","author":"MS Canbolat","year":"2012","unstructured":"Canbolat MS, Wesolowsky GO (2012) On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers. Eur J Oper Res 217(2):241\u2013247","journal-title":"Eur J Oper Res"},{"issue":"3","key":"503_CR11","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/moor.23.3.680","volume":"23","author":"E Carrizosa","year":"1998","unstructured":"Carrizosa E, Plastria F (1998) Locating an undesirable facility by generalized cutting planes. Math Oper Res 23(3):680\u2013694","journal-title":"Math Oper Res"},{"issue":"1999","key":"503_CR12","first-page":"1","volume":"12","author":"E Carrizosa","year":"1999","unstructured":"Carrizosa E, Plastria F (1999) Location of semi-obnoxious facilities. Stud Locat Anal 12(1999):1\u201327","journal-title":"Stud Locat Anal"},{"key":"503_CR13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105468","volume":"138","author":"RL Church","year":"2022","unstructured":"Church RL, Drezner Z (2022) Review of obnoxious facilities location problems. Comput Oper Res 138:105468","journal-title":"Comput Oper Res"},{"issue":"2","key":"503_CR14","doi-asserted-by":"crossref","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(2):107\u2013118","journal-title":"Transp Sci"},{"key":"503_CR15","unstructured":"Coletti K, Kalczynski P, Drezner Z (2023) On the combined inverse-square effect of multiple point sources in multidimensional space. arXiv:2305.02912"},{"issue":"1","key":"503_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10479-005-2042-4","volume":"136","author":"PM Dearing","year":"2005","unstructured":"Dearing PM, Klamroth K, Segars R (2005) Planar location problems with block distance and barriers. Ann Oper Res 136(1):117\u2013143","journal-title":"Ann Oper Res"},{"issue":"4","key":"503_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1111\/j.1467-9787.1995.tb01299.x","volume":"35","author":"Z Drezner","year":"1995","unstructured":"Drezner Z, Wesolowsky GO (1995) Obnoxious facility location in the interior of a planar network. J Reg Sci 35(4):675\u2013688","journal-title":"J Reg Sci"},{"key":"503_CR18","doi-asserted-by":"crossref","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 (2019) The planar multiple obnoxious facilities location problem: a Voronoi based heuristic. Omega 87:105\u2013116","journal-title":"Omega"},{"issue":"12","key":"503_CR19","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1080\/24725854.2020.1753898","volume":"52","author":"T Drezner","year":"2020","unstructured":"Drezner T, Drezner Z, Kalczynski P (2020) Multiple obnoxious facilities location: a cooperative model. IISE Trans 52(12):1403\u20131412","journal-title":"IISE Trans"},{"issue":"3","key":"503_CR20","doi-asserted-by":"crossref","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(3):275\u2013291","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02060478","volume":"40","author":"E Erkut","year":"1992","unstructured":"Erkut E, Neuman S (1992) A multiobjective model for locating undesirable facilities. Ann Oper Res 40(1):209\u2013227","journal-title":"Ann Oper Res"},{"issue":"2","key":"503_CR22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0377-2217(99)00216-7","volume":"121","author":"J Fern\u00e1ndez","year":"2000","unstructured":"Fern\u00e1ndez J, Fern\u00e1ndez P, Pelegr\u0131n B (2000) A continuous location model for siting a non-noxious undesirable facility within a geographical region. Eur J Oper Res 121(2):259\u2013274","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR23","doi-asserted-by":"crossref","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(1):99\u2013131","journal-title":"SIAM Rev"},{"issue":"1","key":"503_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1018951502447","volume":"96","author":"HW Hamacher","year":"2000","unstructured":"Hamacher HW, Klamroth K (2000) Planar Weber location problems with barriers and block norms. Ann Oper Res 96(1):191\u2013208","journal-title":"Ann Oper Res"},{"issue":"6","key":"503_CR25","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-X","volume":"42","author":"HW Hamacher","year":"1995","unstructured":"Hamacher HW, Nickel S (1995) Restricted planar location problems and applications. Nav Res Logist (NRL) 42(6):967\u2013992","journal-title":"Nav Res Logist (NRL)"},{"issue":"4","key":"503_CR26","doi-asserted-by":"crossref","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(4):165\u2013169","journal-title":"Oper Res Lett"},{"issue":"3","key":"503_CR27","first-page":"299","volume":"3","author":"P Hansen","year":"1981","unstructured":"Hansen P, Cohon J (1981) On the location of an obnoxious facility. Sistemi urbani Napoli 3(3):299\u2013317","journal-title":"Sistemi urbani Napoli"},{"key":"503_CR28","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.cie.2019.01.029","volume":"129","author":"P Kalczynski","year":"2019","unstructured":"Kalczynski P, Drezner Z (2019) Locating multiple facilities using the max-sum objective. Comput Ind Eng 129:136\u2013143","journal-title":"Comput Ind Eng"},{"issue":"3","key":"503_CR29","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1080\/01605682.2020.1851149","volume":"73","author":"P Kalczynski","year":"2022","unstructured":"Kalczynski P, Suzuki A, Drezner Z (2022) Multiple obnoxious facilities with weighted demand points. J Oper Res Soc 73(3):598\u2013607","journal-title":"J Oper Res Soc"},{"issue":"3","key":"503_CR30","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/S0377-2217(99)00399-9","volume":"130","author":"K Klamroth","year":"2001","unstructured":"Klamroth K (2001) A reduction result for location problems with polyhedral barriers. Eur J Oper Res 130(3):486\u2013497","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0360-8352(03)00028-7","volume":"45","author":"RG McGarvey","year":"2003","unstructured":"McGarvey RG, Cavalier TM (2003) A global optimal approach to facility location in the presence of forbidden regions. Comput Ind Eng 45(1):1\u201315","journal-title":"Comput Ind Eng"},{"issue":"2","key":"503_CR32","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0305-0548(03)00241-7","volume":"32","author":"RG McGarvey","year":"2005","unstructured":"McGarvey RG, Cavalier TM (2005) Constrained location of competitive facilities in the plane. Comput Oper Res 32(2):359\u2013378","journal-title":"Comput Oper Res"},{"issue":"2","key":"503_CR33","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0377-2217(86)90045-7","volume":"24","author":"E Melachrinoudis","year":"1986","unstructured":"Melachrinoudis E, Cullinane TP (1986) Locating an undesirable facility with a minimax criterion. Eur J Oper Res 24(2):239\u2013246","journal-title":"Eur J Oper Res"},{"issue":"14","key":"503_CR34","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1016\/S0305-0548(02)00140-5","volume":"30","author":"E Melachrinoudis","year":"2003","unstructured":"Melachrinoudis E, Xanthopulos Z (2003) Semi-obnoxious single facility location in Euclidean space. Comput Oper Res 30(14):2191\u20132209","journal-title":"Comput Oper Res"},{"issue":"2","key":"503_CR35","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S0377-2217(98)00138-6","volume":"114","author":"J Munoz-Perez","year":"1999","unstructured":"Munoz-Perez J, Saameno-Rodriguez JJ (1999) Location of an undesirable facility in a polygonal region with forbidden zones. Eur J Oper Res 114(2):372\u2013379","journal-title":"Eur J Oper Res"},{"issue":"8","key":"503_CR36","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1057\/jors.2016.5","volume":"67","author":"M O\u011fuz","year":"2016","unstructured":"O\u011fuz M, Bekta\u015f T, Bennell JA, Fliege J (2016) A modelling framework for solving restricted planar location problems using phi-objects. J Oper Res Soc 67(8):1080\u20131096","journal-title":"J Oper Res Soc"},{"issue":"3","key":"503_CR37","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.ejor.2017.11.033","volume":"266","author":"M O\u011fuz","year":"2018","unstructured":"O\u011fuz M, Bekta\u015f T, Bennell JA (2018) Multicommodity flows and benders decomposition for restricted continuous location problems. Eur J Oper Res 266(3):851\u2013863","journal-title":"Eur J Oper Res"},{"issue":"1","key":"503_CR38","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1026127430341","volume":"123","author":"Y Ohsawa","year":"2003","unstructured":"Ohsawa Y, Tamura K (2003) Efficient location for a semi-obnoxious facility. Ann Oper Res 123(1):173\u2013188","journal-title":"Ann Oper Res"},{"issue":"1","key":"503_CR39","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0377-2217(98)00335-X","volume":"119","author":"F Plastria","year":"1999","unstructured":"Plastria F, Carrizosa E (1999) Undesirable facility location with minimal covering objectives. Eur J Oper Res 119(1):158\u2013180","journal-title":"Eur J Oper Res"},{"issue":"16\u201317","key":"503_CR40","doi-asserted-by":"crossref","first-page":"2604","DOI":"10.1016\/j.dam.2013.05.010","volume":"161","author":"F Plastria","year":"2013","unstructured":"Plastria F, Gordillo J, Carrizosa E (2013) Locating a semi-obnoxious covering facility with repelling polygonal regions. Discrete Appl Math 161(16\u201317):2604\u20132623","journal-title":"Discrete Appl Math"},{"issue":"6","key":"503_CR41","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.50.6.1018.356","volume":"50","author":"S Sava\u015f","year":"2002","unstructured":"Sava\u015f S, Batta R, Nagi R (2002) Finite-size facility placement in the presence of barriers to rectilinear travel. Oper Res 50(6):1018\u20131031","journal-title":"Oper Res"},{"key":"503_CR42","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1975) Closest-point problems. In: 16th annual symposium on foundations of computer science (sfcs 1975). IEEE, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"issue":"8","key":"503_CR43","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368653","volume":"5","author":"M Shimrat","year":"1962","unstructured":"Shimrat M (1962) Algorithm 112: position of point relative to polygon. Commun ACM 5(8):434","journal-title":"Commun ACM"},{"key":"503_CR44","unstructured":"UNEP-WCMC, IUCN (2021) Protected planet: the world database on protected areas (WDPA) and world database on other effective area-based conservation measures (WD-OECM). Protected Planet. www.protectedplanet.net. Accessed 22"},{"key":"503_CR45","unstructured":"van den Bossche J, Jordahl K, Fleischmann M (2021) Geopandas: Python tools for geographic data"},{"key":"503_CR46","unstructured":"Wolfram Research, Inc. (2022) Mathematica, Version 13.1. Champaign, IL, 2020"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-024-00503-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-024-00503-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-024-00503-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T12:13:49Z","timestamp":1719058429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-024-00503-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s10287-024-00503-4","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"26 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"23"}}