{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:07:53Z","timestamp":1772104073601,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00800-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T18:20:01Z","timestamp":1047666001000},"page":"20-35","source":"Crossref","is-referenced-by-count":23,"title":["Algebraic properties of location problems with one circular barrier"],"prefix":"10.1016","volume":"154","author":[{"given":"K.","family":"Klamroth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00800-7_BIB1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/trsc.28.1.70","article-title":"Algorithms for Weber facility location in the presence of forbidden regions and\/or barriers to travel","volume":"28","author":"Aneja","year":"1994","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/trsc.23.1.26","article-title":"Locating facilities on the Manhatten metric with arbitrarily shaped barriers and convex forbidden regions","volume":"23","author":"Batta","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB3","series-title":"Nonlinear Programming","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB4","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Katz, M., Mitchell, J., 2001. Farthest neighbors and center points in the presence of rectangular obstacles. In: Proceedings of the 17th ACM Symposium on Computational Geometry","DOI":"10.1145\/378583.378657"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"C-28","author":"Bentley","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB6","unstructured":"Bronstein, I., Semendjajew, K., 1985. Taschenbuch der Mathematik. 22nd. ed. Teubner, Leipzig"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB7","unstructured":"Butt, E., 1994. Facility Location in the Presence of Forbidden Regions. Ph.D. thesis, Department of Industrial and Management Systems Engineering, Pennsylvania State University, PR"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(94)00297-5","article-title":"An efficient algorithm for facility location in the presence of forbidden regions","volume":"90","author":"Butt","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segments in the plane","volume":"39","author":"Chazelle","year":"1992","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB10","series-title":"Proc. 9th Annu. Internal. Sympos. Algorithms Comput","first-page":"29","article-title":"Computing weighted rectilinear median and center set in the presence of obstacles","volume":"vol. 1533","author":"Choi","year":"1998"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Computational Geometry"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB12","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/nav.10038","article-title":"Dominating sets for rectilinear center location problems with polyhedral barriers","volume":"49","author":"Dearing","year":"2002","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB13","article-title":"Calculus of Variations","volume":"vol. 19","author":"Elsgolc","year":"1962"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB14","doi-asserted-by":"crossref","unstructured":"Fekete, S., Mitchell, J., Weinbrecht, K., 2000. On the continuous Weber and k-median problems. Technical Report No. 666\/2000, Technische Universit\u00e4t Berlin, Department of Mathematics","DOI":"10.1145\/336154.336182"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB15","series-title":"Effiziente Dimensionsreduktion in Multilokationsproblemen","author":"Fliege","year":"1997"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1018951502447","article-title":"Planar location problems with barriers under polyhedral gauges","volume":"96","author":"Hamacher","year":"2000","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0966-8349(98)00053-9","article-title":"Classification of location problems","volume":"6","author":"Hamacher","year":"1998","journal-title":"Location Science"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB18","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1287\/opre.33.6.1251","article-title":"The minisum and minimax location problems revisited","volume":"33","author":"Hansen","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB19","series-title":"Facility Location","first-page":"43","article-title":"Global optimization in location","author":"Hansen","year":"1995"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB20","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/321062.321069","article-title":"Direct search solution of numerical and statistical problems","volume":"8","author":"Hooke","year":"1961","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB22","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0377-2217(81)90203-4","article-title":"Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle","volume":"6","author":"Katz","year":"1981","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB23","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1080\/02331930108844547","article-title":"Planar Weber location problems with line barriers","volume":"49","author":"Klamroth","year":"2001","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB24","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/S0377-2217(99)00399-9","article-title":"A reduction result for location problems with polyhedral barriers","volume":"130","author":"Klamroth","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB25","doi-asserted-by":"crossref","DOI":"10.1007\/b98843","article-title":"Single-Facility Location Problems with Barriers","author":"Klamroth","year":"2002"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB26","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.50.4.670.2857","article-title":"A bi-objective median location problem with a line barrier","volume":"50","author":"Klamroth","year":"2002","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB27","unstructured":"Krau, S., 1996. Extensions du Probl\u00e8me de Weber. Ph.D. thesis, D\u00e9partement de Math\u00e9matiques et de G\u00e9nie Industriel, Universit\u00e9 de Montr\u00e9al"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB28","series-title":"Proc. of ISAAC\u201997","article-title":"An algorithm for finding a region with the minimum total L1 from prescribed terminals","volume":"vol. 1350","author":"Kusakari","year":"1997"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB29","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/opre.31.4.652","article-title":"Facility locations with the Manhattan metric in the presence of barriers to travel","volume":"31","author":"Larson","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB30","series-title":"Facilities Location: Models and Methods","author":"Love","year":"1988"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB31","unstructured":"Ochs, M., 1998. 1-Standort Medianprobleme mit einfachen Barrieren. Diplomarbeit, Department of Mathematics, University of Kaiserslautern, Germany"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB32","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\/S0377-2217(02)00800-7_BIB33","series-title":"Facility Location","first-page":"225","article-title":"Continuous location problems","author":"Plastria","year":"1995"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB34","series-title":"Optimization\u2013\u2013Algorithms and Consistent Approximations","author":"Polak","year":"1997"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB35","series-title":"Variational Analysis","author":"Rockafellar","year":"1998"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB36","doi-asserted-by":"crossref","unstructured":"Sava\u015f, S., Batta, R., Nagi, R., 2001. Finite-size facility placement in the presence of barriers to rectilinear travel. Working paper, Department of Industrial Engineering, University at Buffalo, NY","DOI":"10.1287\/opre.50.6.1018.356"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB37","unstructured":"Segars Jr., R., 2000. Location Problems with Barriers Using Rectilinear Distance. Ph.D. thesis, Department of Mathematical Sciences, Clemson University, SC"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB38","series-title":"Variational Methods in Optimization","author":"Smith","year":"1974"},{"key":"10.1016\/S0377-2217(02)00800-7_BIB39","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0305-0548(01)00078-8","article-title":"Supply facility and input\/output point locations in the presence of barriers","volume":"29","author":"Wang","year":"2002","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:02:30Z","timestamp":1584489750000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221702008007"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00800-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}