TY - JOUR
T1 - Locating two obnoxious facilities using the weighted maximin criterion
AU - Tamir, Arie
PY - 2006/1
Y1 - 2006/1
N2 - Given are a finite set of points P and a compact polygonal set S in R2. The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.
AB - Given are a finite set of points P and a compact polygonal set S in R2. The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.
KW - Maximin criteria
KW - Obnoxious facilities
KW - Planar location models
UR - http://www.scopus.com/inward/record.url?scp=28044443622&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2005.02.004
DO - 10.1016/j.orl.2005.02.004
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:28044443622
SN - 0167-6377
VL - 34
SP - 97
EP - 105
JO - Operations Research Letters
JF - Operations Research Letters
IS - 1
ER -