Multiple obnoxious facilities location: A cooperative model

2020 ◽  
Vol 52 (12) ◽  
pp. 1403-1412 ◽  
Author(s):  
Tammy Drezner ◽  
Zvi Drezner ◽  
Pawel Kalczynski
Omega ◽  
2019 ◽  
Vol 87 ◽  
pp. 105-116 ◽  
Author(s):  
Zvi Drezner ◽  
Pawel Kalczynski ◽  
Said Salhi

Pancreas ◽  
2008 ◽  
Vol 36 (2) ◽  
pp. 223
Author(s):  
Whitney Evans ◽  
Carl Lokko ◽  
Martin E. Fernandez-Zapico ◽  
Alexandrine Randriamahefa ◽  
Gwen Lomberk ◽  
...  

1981 ◽  
Vol 32 (9) ◽  
pp. 803 ◽  
Author(s):  
J. Karkazis ◽  
T. B. Boffey

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.


2008 ◽  
Vol 56 (7) ◽  
pp. 1650-1655 ◽  
Author(s):  
O. Gueguen ◽  
J. Richeton ◽  
S. Ahzi ◽  
A. Makradi

Sign in / Sign up

Export Citation Format

Share Document