Locating a semi-obnoxious facility with expropriation

Authors:
Oded Berman;Qian Wang
Affiliations:
Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ont., Canada M5S 3E6;Management School, Graduate University of Chinese Academy of Sciences, 80 Zhongguancun East Road, Beijing 100080, P.R. China
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 2

Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
Bicriteria location of a semi-obnoxious facility

Computers and Industrial Engineering
The generalized maximal covering location problem

Computers and Operations Research - Location analysis
A Survey on Obnoxious Facility Location Problems

A Survey on Obnoxious Facility Location Problems

Transmitter location for maximum coverage and constructive-destructive interference management

Computers and Operations Research
Locating a semi-obnoxious covering facility with repelling polygonal regions

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the problem of locating semi-obnoxious facilities assuming that ''too close'' demand nodes can be expropriated by the developer at a given price. The objective is to maximize the minimum weighted distance from the facility to the non-expropriated demand nodes given a limited budget while taking into account the fact that customers do not want to be too far away from the facility. Two models of this problem on a network are presented. One is to minimize the difference between the maximum and the minimum weighted distances. The other one is to maximize the minimum weighted distance subject to an upper bound constraint on the maximum weighted distance. The dominating sets are determined and efficient algorithms are presented.