An edge-based stochastic facility location problem in UAV-supported humanitarian relief logistics: a case study of Tehran earthquake

2017 ◽  
Vol 87 (3) ◽  
pp. 1545-1565 ◽  
Author(s):  
Mahmoud Golabi ◽  
Seyed Mahdi Shavarani ◽  
Gokhan Izbirak
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Humanitarian Relief ◽  
Edge Based

The facility location problem in the steel industry: a case study in Latin America

2011 ◽  
Vol 23 (1) ◽  
pp. 26-46 ◽  
Author(s):  
S.V. Conceição ◽  
L.H.P. Pedrosa ◽  
A.S.C. Neto ◽  
M. Vinagre ◽  
E. Wolff
Keyword(s):  
Latin America ◽  
Facility Location ◽  
Steel Industry ◽  
Location Problem ◽  
Facility Location Problem

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

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.

Sign in / Sign up

Export Citation Format

Share Document