Two classes of location problems on tree networks

Cybernetics ◽  
1984 ◽  
Vol 19 (4) ◽  
pp. 539-544 ◽  
Author(s):  
V. A. Trubin
2020 ◽  
Vol 289 (2) ◽  
pp. 153-172
Author(s):  
Esmaeil Afrashteh ◽  
Behrooz Alizadeh ◽  
Fahimeh Baroughi

Networks ◽  
2013 ◽  
Vol 62 (4) ◽  
pp. 243-254 ◽  
Author(s):  
Miguel A. Lejeune ◽  
Srinivas Y. Prasad

2018 ◽  
Vol 35 (05) ◽  
pp. 1850030 ◽  
Author(s):  
Esmaeil Afrashteh ◽  
Behrooz Alizadeh ◽  
Fahimeh Baroughi ◽  
Kien Trung Nguyen

This paper is concerned with a new variant of the inverse 1-median location problem in which the aim is to modify the customer weights such that a predetermined facility location becomes a 1-median location and the total profit obtained via the weight improvements is maximized. We develop novel combinatorial approaches with linear time complexities for solving the problem on tree networks and in the plane under the rectilinear and Chebyshev norms.


Networks ◽  
1992 ◽  
Vol 22 (1) ◽  
pp. 37-54 ◽  
Author(s):  
E. Erkut ◽  
R. L. Francis ◽  
A. Tamir

1976 ◽  
Vol 24 (4) ◽  
pp. 628-642 ◽  
Author(s):  
P. M. Dearing ◽  
R. L. Francis ◽  
T. J. Lowe

2020 ◽  
pp. 105181
Author(s):  
Marta Baldomero-Naranjo ◽  
Jörg Kalcsics ◽  
Antonio M. Rodríguez-Chía

Sign in / Sign up

Export Citation Format

Share Document