{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:03:11Z","timestamp":1774368191911,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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 & Industrial Engineering"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0360-8352(03)00028-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T17:26:08Z","timestamp":1051723568000},"page":"1-15","source":"Crossref","is-referenced-by-count":36,"title":["A global optimal approach to facility location in the presence of forbidden regions"],"prefix":"10.1016","volume":"45","author":[{"given":"Ronald G.","family":"McGarvey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom M.","family":"Cavalier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0360-8352(03)00028-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\/S0360-8352(03)00028-7_BIB2","series-title":"Handbook of computational geometry","article-title":"Visibility in the plane","author":"Asano","year":"2000"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB3","series-title":"Ph.D. thesis","article-title":"Facility location in the presence of forbidden regions and congested regions","author":"Butt","year":"1994"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB4","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\/S0360-8352(03)00028-7_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location\u2013allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerical Mathematics"},{"issue":"7","key":"10.1016\/S0360-8352(03)00028-7_BIB7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","article-title":"Determining the minimum-area encasing rectangle for an arbitrary closed curve","volume":"18","author":"Freeman","year":"1975","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB8","first-page":"299","article-title":"On the location of an obnoxious facility","volume":"3","author":"Hansen","year":"1981","journal-title":"Sistemi Urbani"},{"issue":"6","key":"10.1016\/S0360-8352(03)00028-7_BIB9","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"},{"issue":"6","key":"10.1016\/S0360-8352(03)00028-7_BIB10","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1137\/S0097539795289604","article-title":"An optimal algorithm for Euclidean shortest paths in the plane","volume":"28","author":"Hershberger","year":"1999","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/PL00009323","article-title":"An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane","volume":"18","author":"Kapoor","year":"1997","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB12","series-title":"Technical report OREM 79006","article-title":"Facility location in the presence of forbidden regions, II: Euclidean distance and several forbidden circles","author":"Katz","year":"1979"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB13","series-title":"Technical report OREM 79011","article-title":"Facility location in the presence of forbidden regions, III: \u2113p distance and polygonal forbidden regions","author":"Katz","year":"1979"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB14","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"},{"issue":"2","key":"10.1016\/S0360-8352(03)00028-7_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1111\/j.1467-9787.1962.tb00902.x","article-title":"An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics","volume":"4","author":"Kuhn","year":"1962","journal-title":"Journal of Regional Science"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB16","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","article-title":"A note on Fermat's problem","volume":"4","author":"Kuhn","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB17","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\/S0360-8352(03)00028-7_BIB18","series-title":"Facilities location: Models and methods","author":"Love","year":"1988"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/opre.6.2.232","article-title":"Link-length minimization in networks","volume":"6","author":"Miehle","year":"1958","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0360-8352(03)00028-7_BIB20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1142\/S0218195996000216","article-title":"Shortest paths among obstacles in the plane","volume":"6","author":"Mitchell","year":"1996","journal-title":"International Journal of Compuational Geometry and Applications"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB21","series-title":"Discretization of planar location problems","author":"Nickel","year":"1995"},{"key":"10.1016\/S0360-8352(03)00028-7_BIB22","series-title":"Facility location: A survey of applications and methods","first-page":"103","article-title":"Using Voronoi diagrams","author":"Suzuki","year":"1995"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:51:26Z","timestamp":1553183486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835203000287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0360835203000287"],"URL":"https:\/\/doi.org\/10.1016\/s0360-8352(03)00028-7","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}