Some Distributed Approaches to the Service Facility Location Problem in Dynamic and Complex Networks

2011 ◽  
pp. 405-432
Author(s):  
Ioannis Stavrakakis
Keyword(s):  
Complex Networks ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Service Facility

scholarly journals The multi-period incremental service facility location problem

2009 ◽  
Vol 36 (5) ◽  
pp. 1356-1375 ◽  
Author(s):  
Maria Albareda-Sambola ◽  
Elena Fernández ◽  
Yolanda Hinojosa ◽  
Justo Puerto
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Service Facility

A computational comparison of several formulations for the multi-period incremental service facility location problem

Top ◽  
2009 ◽  
Vol 18 (1) ◽  
pp. 62-80 ◽  
Author(s):  
Maria Albareda-Sambola ◽  
Antonio Alonso-Ayuso ◽  
Laureano F. Escudero ◽  
Elena Fernández ◽  
Yolanda Hinojosa ◽  
...  
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Service Facility ◽  
Computational Comparison

scholarly journals AMBULANCE SERVICE FACILITY LOCATION PROBLEM

2009 ◽  
Vol 52 (3) ◽  
pp. 339-354 ◽  
Author(s):  
Hao-Ching Hsia ◽  
Hiroaki Ishii ◽  
Kuang-Yih Yeh
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Ambulance Service ◽  
Service Facility

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