The Uniform Cost Reverse 1-Centdian Location Problem on Tree Networks with Edge Length Reduction

2021 ◽  
Author(s):  
Kien Trung Nguyen ◽  
Wen Chean Teh
Keyword(s):  
Location Problem ◽  
Edge Length ◽  
Tree Networks ◽  
Length Reduction

The cardinality constrained inverse center location problems on tree networks with edge length augmentation

2021 ◽  
Vol 865 ◽  
pp. 12-33
Author(s):  
Mehran Hasanzadeh ◽  
Behrooz Alizadeh ◽  
Fahimeh Baroughi
Keyword(s):  
Edge Length ◽  
Location Problems ◽  
Tree Networks ◽  
Center Location

scholarly journals An O(nlog2n) algorithm for the optimal sink location problem in dynamic tree networks

2006 ◽  
Vol 154 (16) ◽  
pp. 2387-2401 ◽  
Author(s):  
Satoko Mamada ◽  
Takeaki Uno ◽  
Kazuhisa Makino ◽  
Satoru Fujishige
Keyword(s):  
Location Problem ◽  
Tree Networks ◽  
Dynamic Tree ◽  
Sink Location

scholarly journals A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

Top ◽  
2012 ◽  
Vol 22 (1) ◽  
pp. 227-253 ◽  
Author(s):  
Mark-Christoph Körner ◽  
Juan A. Mesa ◽  
Federico Perea ◽  
Anita Schöbel ◽  
Daniel Scholz
Keyword(s):  
Location Problem ◽  
Alternative Mode ◽  
Tree Networks ◽  
Mode Of Transportation

scholarly journals The Inverse 1-Median Problem on Tree Networks with Variable Real Edge Lengths

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Longshu Wu ◽  
Joonwhoan Lee ◽  
Jianhua Zhang ◽  
Qin Wang
Keyword(s):  
Location Problem ◽  
Hamming Distance ◽  
Linear Time ◽  
Shopping Centers ◽  
Median Problem ◽  
Tree Networks ◽  
Total Cost ◽  
Negative Edge ◽  
Polynomial Time Algorithms ◽  
Np Hardness

Location problems exist in the real world and they mainly deal with finding optimal locations for facilities in a network, such as net servers, hospitals, and shopping centers. The inverse location problem is also often met in practice and has been intensively investigated in the literature. As a typical inverse location problem, the inverse 1-median problem on tree networks with variable real edge lengths is discussed in this paper, which is to modify the edge lengths at minimum total cost such that a given vertex becomes a 1-median of the tree network with respect to the new edge lengths. First, this problem is shown to be solvable in linear time with variable nonnegative edge lengths. For the case when negative edge lengths are allowable, the NP-hardness is proved under Hamming distance, and strongly polynomial time algorithms are presented underl1andl∞norms, respectively.

The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion

2020 ◽  
Vol 506 ◽  
pp. 383-394 ◽  
Author(s):  
Akram Soltanpour ◽  
Fahimeh Baroughi ◽  
Behrooz Alizadeh
Keyword(s):  
At Risk ◽  
Value At Risk ◽  
Location Problem ◽  
Tree Networks ◽  
Risk Criterion

Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks

2018 ◽  
Vol 178 (3) ◽  
pp. 914-934 ◽  
Author(s):  
Behrooz Alizadeh ◽  
Esmaeil Afrashteh ◽  
Fahimeh Baroughi
Keyword(s):  
Location Problem ◽  
Combinatorial Algorithms ◽  
Tree Networks

Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective

2018 ◽  
Vol 23 (17) ◽  
pp. 7843-7852 ◽  
Author(s):  
Akram Soltanpour ◽  
Fahimeh Baroughi ◽  
Behrooz Alizadeh
Keyword(s):  
At Risk ◽  
Value At Risk ◽  
Location Problem ◽  
Tree Networks ◽  
Intuitionistic Fuzzy
Sign in / Sign up

Export Citation Format

Share Document