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 Inverse 1-center location problems with edge length augmentation on trees

Computing ◽  
2009 ◽  
Vol 86 (4) ◽  
pp. 331-343 ◽  
Author(s):  
Behrooz Alizadeh ◽  
Rainer E. Burkard ◽  
Ulrich Pferschy
Keyword(s):  
Edge Length ◽  
Location Problems ◽  
Center Location

Inverse obnoxious p-median location problems on trees with edge length modifications under different norms

2019 ◽  
Vol 772 ◽  
pp. 73-87 ◽  
Author(s):  
Behrooz Alizadeh ◽  
Esmaeil Afrashteh ◽  
Fahimeh Baroughi
Keyword(s):  
Edge Length ◽  
Location Problems

scholarly journals Center location problems on tree graphs with subtree-shaped customers

2008 ◽  
Vol 156 (15) ◽  
pp. 2890-2910 ◽  
Author(s):  
J. Puerto ◽  
A. Tamir ◽  
J.A. Mesa ◽  
D. Pérez-Brito
Keyword(s):  
Location Problems ◽  
Tree Graphs ◽  
Center Location

A Wavefront Approach to Center Location Problems with Barriers

2005 ◽  
Vol 136 (1) ◽  
pp. 35-48 ◽  
Author(s):  
L. Frießs ◽  
K. Klamroth ◽  
M. Sprau
Keyword(s):  
Location Problems ◽  
Center Location

Two classes of location problems on tree networks

Cybernetics ◽  
1984 ◽  
Vol 19 (4) ◽  
pp. 539-544 ◽  
Author(s):  
V. A. Trubin
Keyword(s):  
Location Problems ◽  
Tree Networks

scholarly journals Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

2017 ◽  
Vol 27 (3) ◽  
pp. 367-384 ◽  
Author(s):  
Roghayeh Etemad ◽  
Behrooz Alizadeh
Keyword(s):  
Facility Location ◽  
Upper Bound ◽  
Location Problem ◽  
The Other ◽  
Location Problems ◽  
Combinatorial Algorithms ◽  
Optimal Solutions ◽  
Total Cost ◽  
Tree Graphs ◽  
Center Location

This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree. The first model aims to modify the edge lengths within a given modification budget until a prespecified facility location becomes as close as possible to the customer points. However, the other model wishes to change the edge lengths at the minimum total cost so that the distances between the prespecified facility and the customers satisfy a given upper bound. We develop novel combinatorial algorithms with polynomial time complexities for deriving the optimal solutions of the problems under investigation.

Sign in / Sign up

Export Citation Format

Share Document