Abstract
This paper deals with a general variant of the reverse undesirable (obnoxious) center location problem on cycle graphs. Given a ‘selective’ subset of the vertices of the underlying cycle graph as location of the existing customers, the task is to modify the edge lengths within a given budget such that the minimum of distances between a predetermined undesirable facility location and the customer points is maximized under the perturbed edge lengths. We develop a combinatorial \(\mathcal {O}(n\log n)\) algorithm for the problem with continuous modifications. For the uniform-cost model, we solve this problem in linear time by an improved algorithm. Furthermore, exact solution methods are proposed for the problem with integer modifications.
Similar content being viewed by others
References
Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discret. Appl. Math. 133, 3–28 (2003)
Plastria, F.: Optimal location of undesirable facilities: a selective overview. Belg. J. Oper. Res. Stat. Comput. Sci. 36, 109–127 (1996)
Zanjirani, R., Hekmatfar, M.: Facility Location: Concepts, Models. Algorithms and Case Studies. Physica-Verlag, Berlin (2009)
Gassner, E.: The inverse 1-maxian problem with edge length modification. J. Comb. Optim. 16, 50–67 (2007)
Galavii, M.: Inverse 1-median problems. Ph.D. Thesis, Institute of Optimization and Discrete Mathematics, Graz University of Technology, Graz (2008)
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 (2012)
Alizadeh, B., Etemad, R.: Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization 65(11), 2025–2036 (2016). doi:10.1080/02331934.2016.1203915
Berman, O., Ingco, D.I., Odoni, A.R.: Improving the location of minmax facility through network modification. Networks 24, 31–41 (1994)
Cai, M.C., Yang, X.G., Zhang, J.Z.: The complexity analysis of the inverse center location problem. J. Glob. Optim. 15, 213–218 (1999)
Nguyen, K.T., Chassein, A.: Inverse eccentric vertex problem on networks. Cent. Eur. J. Oper. Res. 23, 687–698 (2015)
Zhang, J.Z., Liu, Z.H., Ma, Z.F.: Some reverse location problems. Eur. J. Oper. Res. 124, 77–88 (2000)
Alizadeh, B., Burkard, R.E., Pferschy, U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86, 331–343 (2009)
Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58, 190–200 (2011)
Alizadeh, B., Burkard, R.E.: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discret. Appl. Math. 159, 706–716 (2011)
Nguyen, K.T.: Reverse 1-center problem on weighted trees. Optimization 65, 253–264 (2015)
Nguyen, K.T., Sepasian, A.R.: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J. Comb. Optim. 32, 872–884 (2016)
Nguyen, K.T., Anh, L.Q.: Inverse \(k\)-centrum problem on trees with variable vertex weights. Math. Methods Oper. Res. 82, 19–30 (2015)
Berman, O., Ingco, D.I., Odoni, A.R.: Improving the location of minisum facility through network modification. Ann. Oper. Res. 40, 1–16 (1992)
Bonab, F.B., Burkard, R.E., Gassner, E.: Inverse p-median problems with variable edge lengths. Math. Methods Oper. Res. 73, 263–280 (2011)
Burkard, R.E., Gassner, E., Hatzl, J.: Reverse 2-median problems on trees. Discret. Appl. Math. 156, 1963–1976 (2008)
Burkard, R.E., Pleschiutsching, C., Zhang, J.: Inverse median problems. Discret. Optim. 1, 23–39 (2004)
Sepasian, A.R., Rahbarnia, F.: An \(O(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64, 595–602 (2015)
Etemad, R., Alizadeh, B.: Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms. Yugosl. J. Oper. Res. (2016). doi:10.2298/YJOR160317012E
Acknowledgements
The authors are grateful to anonymous referees for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the Sahand University of Technology under the Ph.D. program contract (No. 30/15971).
Rights and permissions
About this article
Cite this article
Etemad, R., Alizadeh, B. Combinatorial Algorithms for Reverse Selective Undesirable Center Location Problems on Cycle Graphs. J. Oper. Res. Soc. China 5, 347–361 (2017). https://doi.org/10.1007/s40305-016-0144-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40305-016-0144-0