On destination optimality in asymmetric distance Fermat-Weber problems
Annals of Operations Research - Special issue on locational decisions
Bicriteria location of a semi-obnoxious facility
Computers and Industrial Engineering
On bisectors for different distance functions
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Aggregation Error Bounds for a Class of Location Models
Operations Research
Semi-obnoxious single facility location in Euclidean space
Computers and Operations Research
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
Operations Research
Finding an Euclidean anti-k-centrum location of a set of points
Computers and Operations Research
A general model for the undesirable single facility location problem
Operations Research Letters
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
The ordered anti-median problem with distances derived from a strictly convex norm
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, a family of single-obnoxious-facility location problems is modelled by considering the same objective function as is used in the ordered median location problem. This function involves distances defined with any arbitrary norm and hence it can be used in a general framework. We prove that the solutions to these obnoxious location problems, restricted to a polygonal region with m vertices and considering n existing population centers, can be found in a set defined in terms of the weighted equidistant points. For many usual norms, this dominating set is finite and can be constructed in O(mn^2+n^4).