Locating two obnoxious facilities using the weighted maximin criterion

Arie Tamir

doi:10.1016/j.orl.2005.02.004

Locating two obnoxious facilities using the weighted maximin criterion

Arie Tamir^*

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	97-105
Number of pages	9
Journal	Operations Research Letters
Volume	34
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2005.02.004
State	Published - Jan 2006

Keywords

Maximin criteria
Obnoxious facilities
Planar location models

Access to Document

10.1016/j.orl.2005.02.004

Cite this

@article{3cb5231d745b4063a1f537d6d6d31b62,

title = "Locating two obnoxious facilities using the weighted maximin criterion",

abstract = "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.",

keywords = "Maximin criteria, Obnoxious facilities, Planar location models",

author = "Arie Tamir",

year = "2006",

month = jan,

doi = "10.1016/j.orl.2005.02.004",

language = "אנגלית",

volume = "34",

pages = "97--105",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "1",

}

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 - https://www.scopus.com/pages/publications/28044443622

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 -

Locating two obnoxious facilities using the weighted maximin criterion

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this