Abstract
For an inverse obnoxious center location problem, the edge lengths of the underlying network have to be changed within given bounds at minimum total cost such that a predetermined point of the network becomes an obnoxious center location under the new edge lengths. The cost is proportional to the increase or decrease, resp., of the edge length. The total cost is defined as sum of all cost incurred by length changes. For solving this problem on a network with m edges an algorithm with running time \({\mathcal{O}(m)}\) is developed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alizadeh B, Burkard RE (2011) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58: 190–200
Alizadeh B, Burkard RE (2011) Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discret Appl Math 159: 706–716
Alizadeh B, Burkard RE, Pferschy U (2009) Inverse 1-center location problems with edge length augmentation on trees. Computing 86: 331–343
Baroughi Bonab F, Burkard RE, Alizadeh B (2010) Inverse median location problems with variable coordinates. Central Eur J Oper Res 18: 365–381
Baroughi Bonab F, Burkard RE, Gassner E (2011) Inverse p-median problems with variable edge lengths. Math Methods Oper Res 73: 263–280
Burkard RE, Galavii M, Gassner E (2010) The inverse Fermat-Weber problem. Eur J Oper Res 206: 11–17
Burkard RE, Pleschiutschnig C, Zhang J (2004) Inverse median problems. Discret Optim 1: 23–39
Burkard RE, Pleschiutschnig C, Zhang J (2007) The inverse 1-median problem on a cycle. Discret Optim 5: 242–253
Cai MC, Yang XG, Zhang JZ (1999) The complexity analysis of the inverese center location problem. J Glob Optim 15: 213–218
Cappanera P, Gallo G, Maffioli F (2003) Discrete facility location and routing of obnoxious activities. Discret Appl Math 133: 3–28
Carrizosa E, Plastria F (1999) Location of semi-obnoxious facilities. Stud Locat Anal 12: 1–27
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. 2nd edn. MIT Press, Cambridge
Galavii M (2008) Inverse 1-median problems, Ph.D. Thesis, Institute of Optimization and Discrete Mathematics, Graz University of Technology, Graz, Austria
Gassner E (2007) The inverse 1-maxian problem with edge length modification. J Comb Optim 16: 50–67
Gassner E (2012) An inverse approach to convex ordered median problems in trees. J Comb Optim 23: 261–273
Plastria F (1996) Optimal location of undesirable facilities: a selective overview. Belgian J Oper Res Stat Comput Sci 36: 109–127
Yang X, Zhang J (2008) Inverse center location problem on a tree. J Syst Sci Complex 21: 651–664
Zanjirani R, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alizadeh, B., Burkard, R.E. A linear time algorithm for inverse obnoxious center location problems on networks. Cent Eur J Oper Res 21, 585–594 (2013). https://doi.org/10.1007/s10100-012-0248-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-012-0248-5