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
2017 ◽  
Vol 27 (3) ◽  
pp. 367-384 ◽  
Author(s):  
Roghayeh Etemad ◽  
Behrooz Alizadeh

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.


Computing ◽  
2009 ◽  
Vol 86 (4) ◽  
pp. 331-343 ◽  
Author(s):  
Behrooz Alizadeh ◽  
Rainer E. Burkard ◽  
Ulrich Pferschy

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

Optimization ◽  
2019 ◽  
Vol 68 (5) ◽  
pp. 999-1015 ◽  
Author(s):  
Kien Trung Nguyen ◽  
Nguyen Thanh Hung ◽  
Huong Nguyen-Thu ◽  
Tran Thu Le ◽  
Van Huy Pham

Sign in / Sign up

Export Citation Format

Share Document