Review of Obnoxious Facilities Location Problems

2021 ◽  
pp. 105468
Author(s):  
Richard L. Church ◽  
Zvi Drezner
Keyword(s):  
Location Problems ◽  
Obnoxious Facilities ◽  
Facilities Location

Multiple obnoxious facilities location: A cooperative model

2020 ◽  
Vol 52 (12) ◽  
pp. 1403-1412 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner ◽  
Pawel Kalczynski
Keyword(s):  
Cooperative Model ◽  
Obnoxious Facilities ◽  
Facilities Location

scholarly journals The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Omega ◽  
2019 ◽  
Vol 87 ◽  
pp. 105-116 ◽  
Author(s):  
Zvi Drezner ◽  
Pawel Kalczynski ◽  
Said Salhi
Keyword(s):  
Location Problem ◽  
Obnoxious Facilities ◽  
Facilities Location

An Evaluation of the Dual as a Lower Bound in Facilities Location Problems

1987 ◽  
Vol 19 (2) ◽  
pp. 160-166 ◽  
Author(s):  
Paul D. Dowling ◽  
Robert F. Love
Keyword(s):  
Lower Bound ◽  
Location Problems ◽  
Facilities Location

A modified optimal algorithm for 2-maxian location problems on cactus graphs

2017 ◽  
Vol 10 (01) ◽  
pp. 1750017
Author(s):  
L. Modabber ◽  
B. Alizadeh ◽  
F. Baroughi
Keyword(s):  
Location Problem ◽  
Optimal Algorithm ◽  
Optimal Solution ◽  
Location Problems ◽  
Obnoxious Facilities ◽  
Cactus Graph ◽  
Generic Solution ◽  
Cactus Graphs ◽  
Modified Algorithm

This paper considers the [Formula: see text]-maxian location problem on a cactus graph [Formula: see text] in which the aim is to find two points on [Formula: see text] for establishing obnoxious facilities such that the sum of weighted distances from all vertices (existing clients) to the farthest facility is maximized. We develop a modified algorithm for obtaining an optimal solution of the problem under investigation. The proposed algorithm is based on the generic solution idea by Kang et al., while it is straightforward and takes lower computational operations.

Sign in / Sign up

Export Citation Format

Share Document