arbiter
JournalsPricingAccount

OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS

Paweł Kalczyński et al.

Journal of the Operations Research Society of Japan2023https://doi.org/10.15807/jorsj.66.37article
ABDC B
Weight
0.36

What the paper says

The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three new global optimal solution approaches are proposed. Two variants of the “Big Triangle Small Triangle” global optimization method, and a procedure based on intersection points between Apollonius circles. We also compared the results with a multi-start approach using the non-linear multi-purpose software SNOPT. Problems with 1,000 demand points are exactly solved in a fraction of a second of computer time.

3 citations

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.15807/jorsj.66.37

Or copy a formatted citation

@article{paweł2023,
  title        = {{OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS}},
  author       = {Paweł Kalczyński et al.},
  journal      = {Journal of the Operations Research Society of Japan},
  year         = {2023},
  doi          = {https://doi.org/https://doi.org/10.15807/jorsj.66.37},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.36

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.12 × 0.4 = 0.05
M · momentum0.60 × 0.15 = 0.09
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.