scholarly journals Optimal algorithms for inverse vertex obnoxious center location problems on graphs

2018 ◽  
Vol 707 ◽  
pp. 36-45 ◽  
Author(s):  
Behrooz Alizadeh ◽  
Roghayeh Etemad
Keyword(s):  
Location Problems ◽  
Optimal Algorithms ◽  
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

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

Algorithmica ◽  
2007 ◽  
Vol 55 (4) ◽  
pp. 601-618 ◽  
Author(s):  
Binay Bhattacharya ◽  
Qiaosheng Shi ◽  
Arie Tamir
Keyword(s):  
Facility Location ◽  
Location Problems ◽  
Optimal Algorithms ◽  
Facility Location Problems

Optimal algorithms for selective variants of the classical and inverse median location problems on trees

2018 ◽  
Vol 34 (6) ◽  
pp. 1213-1230 ◽  
Author(s):  
Esmaeil Afrashteh ◽  
Behrooz Alizadeh ◽  
Fahimeh Baroughi
Keyword(s):  
Location Problems ◽  
Optimal Algorithms

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

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