Modeling the Gateway Location Problem for Multicommodity Flow Rerouting

2011 ◽  
pp. 262-276 ◽  
Author(s):  
Maurizio Bruglieri ◽  
Paola Cappanera ◽  
Alberto Colorni ◽  
Maddalena Nonato
Keyword(s):  
Location Problem ◽  
Multicommodity Flow

The Gradual Minimal Covering Location Problem

2020 ◽  
Author(s):  
Mostafa Khatami ◽  
Amir Salehipour
Keyword(s):  
Location Problem ◽  
Minimal Covering

The Multi-Commodity Facilities Location Problem

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

scholarly journals Location Problem of Production and Sales under Carbon Tax Policy

2020 ◽  
Vol 1575 ◽  
pp. 012188
Author(s):  
Chong Xiang ◽  
Xiaoshen Li ◽  
Guanglei Sun
Keyword(s):  
Tax Policy ◽  
Location Problem ◽  
Carbon Tax

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