{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:34:17Z","timestamp":1714242857636},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1016\/j.cor.2007.08.004","type":"journal-article","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T11:15:15Z","timestamp":1188472515000},"page":"135-148","source":"Crossref","is-referenced-by-count":22,"title":["Location of a facility minimizing nuisance to or from a planar network"],"prefix":"10.1016","volume":"36","author":[{"given":"Tammy","family":"Drezner","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Drezner","sequence":"additional","affiliation":[]},{"given":"Carlton H.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2007.08.004_bib1","first-page":"299","article-title":"On the location of an obnoxious facility","volume":"3","author":"Hansen","year":"1981","journal-title":"Sistemi Urbani"},{"key":"10.1016\/j.cor.2007.08.004_bib2","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1111\/j.1467-9787.1995.tb01299.x","article-title":"Obnoxious facility location in the interior of a planar network","volume":"35","author":"Drezner","year":"1996","journal-title":"Journal of Regional Science"},{"key":"10.1016\/j.cor.2007.08.004_bib3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","article-title":"Locating an obnoxious facility on a network","volume":"12","author":"Church","year":"1978","journal-title":"Transportation Science"},{"key":"10.1016\/j.cor.2007.08.004_bib4","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/moor.23.3.680","article-title":"Locating an undesirable facility by generalized cutting planes","volume":"23","author":"Carrizosa","year":"1998","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.cor.2007.08.004_bib5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1111\/j.1467-9787.1983.tb00800.x","article-title":"The location of an obnoxious facility with rectangular distances","volume":"23","author":"Drezner","year":"1983","journal-title":"Journal of Regional Science"},{"key":"10.1016\/j.cor.2007.08.004_bib6","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0377-2217(98)00335-X","article-title":"Undesirable facility location with minimal covering objectives","volume":"119","author":"Plastria","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2007.08.004_bib7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0893-9659(92)90031-4","article-title":"Locating an obnoxious facility","volume":"5","author":"Kaiser","year":"1992","journal-title":"Applied Mathematical Letters"},{"key":"10.1016\/j.cor.2007.08.004_bib8","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S0377-2217(98)00138-6","article-title":"Location of an undesirable facility in a polygonal region with forbidden zones","volume":"114","author":"Munoz-Perez","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2007.08.004_bib9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0377-2217(97)00110-0","article-title":"Semi-obnoxious location models: a global optimization approach","volume":"102","author":"Romero-Morales","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2007.08.004_bib10","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","article-title":"Obnoxious facility location on graphs","volume":"4","author":"Tamir","year":"1991","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.cor.2007.08.004_bib11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","article-title":"Analytical models for locating undesirable facilities","volume":"40","author":"Erkut","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2007.08.004_bib12","first-page":"109","article-title":"Optimal location of undesirable facilities: a selective overview","volume":"36","author":"Plastria","year":"1996","journal-title":"Belgian Journal of Operations Research, Statistics, and Computer Science"},{"key":"10.1016\/j.cor.2007.08.004_bib13","series-title":"CRC Standard mathematical tables","author":"Beyer","year":"1981"},{"key":"10.1016\/j.cor.2007.08.004_bib14","series-title":"Non-linear programming","author":"Bazaraa","year":"1993"},{"key":"10.1016\/j.cor.2007.08.004_bib15","series-title":"Generalized concavity","author":"Avriel","year":"1987"},{"key":"10.1016\/j.cor.2007.08.004_bib16","series-title":"VBA for modelers","author":"Albright","year":"2001"},{"key":"10.1016\/j.cor.2007.08.004_bib17","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/opre.1030.0077","article-title":"The big triangle small triangle method for the solution of non-convex facility location problems","volume":"52","author":"Drezner","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2007.08.004_bib18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0377-2217(92)90244-4","article-title":"GBSSS, The generalized big square small square method for planar single facility location","volume":"62","author":"Plastria","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2007.08.004_bib19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10898-006-9051-y","article-title":"A general global optimization approach for solving location problems in the plane","volume":"37","author":"Drezner","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.cor.2007.08.004_bib20","series-title":"Introduction to numerical analysis","author":"Hildebrand","year":"1974"},{"key":"10.1016\/j.cor.2007.08.004_bib21","series-title":"Handbook of mathematical functions","author":"Abramowitz","year":"1972"},{"key":"10.1016\/j.cor.2007.08.004_bib22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218195994000124","article-title":"A robust topology-oriented incremental algorithm for Voronoi diagram","volume":"4","author":"Sugihara","year":"1994","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"10.1016\/j.cor.2007.08.004_bib23","doi-asserted-by":"crossref","first-page":"306","DOI":"10.15807\/jorsj.27.306","article-title":"Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms","volume":"27","author":"Ohya","year":"1984","journal-title":"Journal of the Operations Research Society of Japan"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054807001463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054807001463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T18:23:16Z","timestamp":1556821396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054807001463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["S0305054807001463"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2007.08.004","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}