Advertisement

Mathematical Methods of Operations Research

, Volume 87, Issue 3, pp 431–450 | Cite as

Reverse selective obnoxious center location problems on tree graphs

  • Roghayeh Etemad
  • Behrooz Alizadeh
Original Article

Abstract

In this paper, we investigate a variant of the reverse obnoxious center location problem on a tree graph \(T=(V,E)\) in which a selective subset of the vertex set V is considered as locations of the existing customers. The aim is to augment or reduce the edge lengths within a given budget with respect to modification bounds until a predetermined undesirable facility location becomes as far as possible from the customer points under the new edge lengths. An \({\mathcal {O}}(|E|^2)\) time combinatorial algorithm is developed for the problem with arbitrary modification costs. For the uniform-cost case, one obtains the improved \({\mathcal {O}}(|E|)\) time complexity. Moreover, optimal solution algorithms with \({\mathcal {O}}(|E|^2)\) and \({\mathcal {O}}(|E|)\) time complexities are proposed for the integer version of the problem with arbitrary and uniform cost coefficients, respectively.

Keywords

Obnoxious center location Combinatorial optimization Reverse optimization Time complexity 

Mathematics Subject Classification

90B80 90B85 90C27 90C35 

Notes

Acknowledgements

The authors sincerely thank the editor and anonymous referees, whose constructive and insightful comments led to an improved presentation of this paper.

References

  1. Alizadeh B, Burkard RE (2011) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58:190–200MathSciNetCrossRefzbMATHGoogle Scholar
  2. Alizadeh B, Burkard RE (2011) Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Appl Math 159:706–716MathSciNetCrossRefzbMATHGoogle Scholar
  3. Alizadeh B, Burkard RE (2012) A linear time algorithm for inverse obnoxious center location problems on networks. Cent Eur J Oper Res 21:585–594MathSciNetCrossRefzbMATHGoogle Scholar
  4. Alizadeh B, Burkard RE, Pferschy U (2009) Inverse 1-center location problems with edge length augmentation on trees. Computing 86:331–343MathSciNetCrossRefzbMATHGoogle Scholar
  5. Alizadeh B, Etemad R (2016) Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization 65:2025–2036MathSciNetCrossRefzbMATHGoogle Scholar
  6. Berman O, Ingco DI, Odoni AR (1994) Improving the location of minmax facility through network modification. Networks 24:31–41MathSciNetCrossRefzbMATHGoogle Scholar
  7. Cai MC, Yang XG, Zhang JZ (1999) The complexity analysis of the inverese center location problem. J Global Optim 15:213–218MathSciNetCrossRefzbMATHGoogle Scholar
  8. Cappanera P, Gallo G, Maffioli F (2003) Discrete facility location and routing of obnoxious activities. Discrete Appl Math 133:3–28MathSciNetCrossRefzbMATHGoogle Scholar
  9. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, CambridgezbMATHGoogle Scholar
  10. Eiselt HA (2011) Foundation of location analysis. Springer, New YorkCrossRefzbMATHGoogle Scholar
  11. Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New YorkzbMATHGoogle Scholar
  12. Nguyen KT, Sepasian AR (2016) The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J Comb Optim 32:872–884MathSciNetCrossRefzbMATHGoogle Scholar
  13. Nguyen KT (2015) Reverse 1-center problem on weighted trees. Optimization 65:253–264MathSciNetCrossRefzbMATHGoogle Scholar
  14. Vygen J (2002) On dual minimum cost flow algorithms. Math Methods Oper Res 56:101–126MathSciNetCrossRefzbMATHGoogle Scholar
  15. Yang X, Zhang J (2008) Inverse center location problem on a tree. J Syst Sci Complex 21:651–664MathSciNetCrossRefzbMATHGoogle Scholar
  16. Zanjirani R, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, BerlinCrossRefGoogle Scholar
  17. Zhang JZ, Liu ZH, Ma ZF (2000) Some reverse location problems. Eur J Oper Res 124:77–88MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of Applied Mathematics, Faculty of Basic SciencesSahand University of TechnologyTabrizIran

Personalised recommendations