scholarly journals An O(n log2 n) Algorithm for a Sink Location Problem in Dynamic Tree Networks

2006 ◽  
pp. 251-264 ◽  
Author(s):  
Satoko Mamada ◽  
Takeaki Uno ◽  
Kazuhisa Makino ◽  
Satoru Fujishige
Keyword(s):  
Location Problem ◽  
Tree Networks ◽  
Dynamic Tree ◽  
Sink 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 Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

2014 ◽  
Vol 18 (4) ◽  
pp. 539-555 ◽  
Author(s):  
Yuya Higashikawa ◽  
Mordecai J. Golin ◽  
Naoki Katoh
Keyword(s):  
Location Problem ◽  
Minimax Regret ◽  
Tree Networks ◽  
Dynamic Tree ◽  
Sink Location

Multiple sink location problem in path networks with a combinational objective

2020 ◽  
Author(s):  
Taibo Luo ◽  
Hongmei Li ◽  
Shaofeng Ru ◽  
Weitian Tong ◽  
Yinfeng Xu
Keyword(s):  
Location Problem ◽  
Multiple Sink ◽  
Sink Location

Labeling Schemes for Dynamic Tree Networks

2002 ◽  
pp. 76-87 ◽  
Author(s):  
Amos Korman ◽  
David Peleg ◽  
Yoav Rodeh
Keyword(s):  
Tree Networks ◽  
Labeling Schemes ◽  
Dynamic Tree

Minimax regret vertex 2-sink location problem in dynamic path networks

2014 ◽  
Vol 31 (1) ◽  
pp. 79-94 ◽  
Author(s):  
Hongmei Li ◽  
Yinfeng Xu ◽  
Guanqun Ni
Keyword(s):  
Location Problem ◽  
Minimax Regret ◽  
Dynamic Path ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document