{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:39:18Z","timestamp":1695199158746},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0167-6377(95)00025-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"25-30","source":"Crossref","is-referenced-by-count":15,"title":["An O(mn2) algorithm for the Maximin problem in E2"],"prefix":"10.1016","volume":"18","author":[{"given":"Emanuel","family":"Melachrinoudis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.MacGregor","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00025-F_BIB1","article-title":"Voronoi diagrams-A survey of a fundamental geometric data structure","author":"Aurenhammer","year":"1990"},{"key":"10.1016\/0167-6377(95)00025-F_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","article-title":"An optimal algorithm for constructing the weighted Voronoi diagram in the plane","volume":"17","author":"Aurenhammer","year":"1984","journal-title":"Pattern Recognition"},{"key":"10.1016\/0167-6377(95)00025-F_BIB3","article-title":"Voronoi (Thiessen) Polygons","author":"Boots","year":"1986"},{"key":"10.1016\/0167-6377(95)00025-F_BIB4","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1287\/opre.28.6.1385","article-title":"A Maximin location problem","volume":"28","author":"Dasarathy","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00025-F_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0167-6377(95)00025-F_BIB6","series-title":"Computing and Euclidean Geometry","first-page":"193","article-title":"Voronoi diagrams and Delaunay triangulations","author":"Fortune","year":"1992"},{"key":"10.1016\/0167-6377(95)00025-F_BIB7","article-title":"Algorithms on sets and related problems","author":"Gonzalez","year":"1975"},{"key":"10.1016\/0167-6377(95)00025-F_BIB8","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.4.4.412","article-title":"The Voronoi partition of a network and its implications in location theory","volume":"4","author":"Hakimi","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-6377(95)00025-F_BIB9","series-title":"Proc. 34th Ann. Symp. on Foundations of Computer Science (FOCS'93)","first-page":"692","article-title":"On choosing a dense subgraph (extended abstract)","author":"Kortsarz","year":"1993"},{"key":"10.1016\/0167-6377(95)00025-F_BIB10","article-title":"The Maximim single facility location problem using a Euclidean metric","author":"Melachrinoudis","year":"1980"},{"key":"10.1016\/0167-6377(95)00025-F_BIB11","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1080\/00207548508904725","article-title":"A heuristic approach to the single facility maximin location problem","volume":"23","author":"Melachrinoudis","year":"1985","journal-title":"Internat. J. Prod. Res."},{"key":"10.1016\/0167-6377(95)00025-F_BIB12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9787.1985.tb00297.x","article-title":"Locating an undesirable facility within a geographic region using the MAXIMIM criterion","volume":"25","author":"Melachrinoudis","year":"1985","journal-title":"J. Reg. Sci."},{"key":"10.1016\/0167-6377(95)00025-F_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02026821","article-title":"Locating an obnoxious facility within a polygonal region","volume":"6","author":"Melachrinoudis","year":"1986","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0167-6377(95)00025-F_BIB14","series-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Okabe","year":"1992"},{"issue":"2","key":"10.1016\/0167-6377(95)00025-F_BIB15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","article-title":"Heuristic and special case algorithms for dispersion problems","volume":"42","author":"Ravi","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00025-F_BIB16","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0167-6377(95)00025-F_BIB17","series-title":"Proc. 16th IEEE Ann. Symp. on the Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500025F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500025F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:33Z","timestamp":1555577613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779500025F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["016763779500025F"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00025-f","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}