An O(mn2) algorithm for the Maximin problem in E2
Operations Research Letters
Finding an Euclidean anti-k-centrum location of a set of points
Computers and Operations Research
Probabilistic single obnoxious facility location with fixed budget
Information Processing Letters
On the ordered anti-Weber problem for any norm in R2
Operations Research Letters
Hi-index | 0.00 |
In this paper, a finite set in which an optimal solution for a general Euclidean problem of locating an undesirable facility in a polygonal region, is determined and can be found in polynomial time. The general problem we propose leads us, among others, to several well-known problems such as the maxisum, maximin, anticentdian or r-anticentrum problem.