Reverse 1-centre problem on trees under convex piecewise-linear cost function

References

• Drezner Z, Hamacher HW. Facility location, applications and theory. Berlin: Springer Science & Business Media; 2001.
   Google Scholar
• Mirchandani PB, Francis RL. Discrete location theory. New York: John Wiley and Sons; 1990.
   Google Scholar
• Puerto J, Ricca F, Scozzari A. Extensive facility location problems on networks: an updated review. TOP. 2018 Jul;26(2):187–226.
   Web of Science ®Google Scholar
• Berman O, Ingco DI, Odoni A. Improving the location of minimax facilities through network modification. Networks. 1994;24(1):31–41.
   Web of Science ®Google Scholar
• Zhang J, Liu Z, Ma Z. Some reverse location problems. Eur J Oper Res. 2000;124(1):77–88.
   Web of Science ®Google Scholar
• Nguyen KT. Reverse 1-center problem on weighted trees. Optimization. 2016;65(1):253–264.
   Web of Science ®Google Scholar
• Alizadeh B, Etemad R. Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization. 2016;65(11):2025–2036.
   Web of Science ®Google Scholar
• 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;27(3):367–384.
   Google Scholar
• Etemad R, Alizadeh B. Reverse selective obnoxious center location problems on tree graphs. Math Methods Oper Res. 2018;87(3):431–450.
   Web of Science ®Google Scholar
• Burkard RE, Gassner E, Hatzl J. A linear time algorithm for the reverse 1-median problem on a cycle. Networks. 2006;48(1):16–23.
   Web of Science ®Google Scholar
• Berman O, Ingco DI, Odoni AR. Improving the location of minisum facilities through network modification. Ann Oper Res. 1992;40(1):1–16.
   Google Scholar
• Burkard RE, Gassner E, Hatzl J. Reverse 2-median problem on trees. Discrete Appl Math. 2008;156(11):1963–1976. In Memory of Leonid Khachiyan (1952 -- 2005).
   Web of Science ®Google Scholar
• Wang Q, Bai Y. An efficient algorithm for reverse 2-median problem on A cycle. J Netw. 2010;5(10):1169–1176.
   Google Scholar
• Alizadeh B, Burkard R. Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks. 2011;58(3):190–200.
   Web of Science ®Google Scholar
• Nguyen KT, Sepasian AR. The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and hamming distance. J Comb Optim. 2016 Oct;32(3):872–884.
   Web of Science ®Google Scholar
• Alizadeh B, Burkard RE. Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Appl Math. 2011;159(8):706–716.
   Web of Science ®Google Scholar
• Burkard RE, Pleschiutsching C, Zhang J. Inverse median problems. Discrete Optimization. 2004;1(1):23–39.
   Google Scholar
• Burkard RE, Galavii M, Gassner E. The inverse Fermat-Weber problem. Eur J Oper Res. 2010;206(1):11–17.
   Web of Science ®Google Scholar
• Nguyen KT. Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl. 2016 Mar;168(3):944–957.
   Web of Science ®Google Scholar
• Sepasian AR, Rahbarnia F. An o(n log n) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization. 2015;64(3):595–602.
   Web of Science ®Google Scholar
• Gassner E. The inverse 1-maxian problem with edge length modification. J Comb Optim. 2008 Jul;16(1):50–67.
   Web of Science ®Google Scholar
• Alizadeh B, Etemad R. Optimal algorithms for inverse vertex obnoxious center location problems on graphs. Theor Comput Sci. 2018;707:36–45.
   Web of Science ®Google Scholar
• Alizadeh B, Afrashteh E, Baroughi F. Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks. J Optim Theory Appl. 2018 Sep;178(3):914–934.
   Web of Science ®Google Scholar
• Zhang J, Yang X, Cai Mc. Reverse center location problem. In: International Symposium on Algorithms and Computation; Springer; 1999. p. 279–294.
   Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB. Network flows: Theory, algorithms, and applications. Upper Saddle River, NJ, USA: Prentice-Hall, Inc.; 1993.
   Google Scholar
• Fourer  R. A simplex algorithm for piecewise-linear programming I: Derivation and proof. Mathematical programming. 1985; 33(2): 204–233.
   Web of Science ®Google Scholar
• Broder AZ, Dyer ME, Frieze AM. The worst-case running time of the random simplex algorithm is exponential in the height. Inf Process Lett. 1995;56(2):79–81.
   Web of Science ®Google Scholar
• Dantzig G. Linear programming and extensions. Princeton, NJ: Princeton Univ. Press; 1963.
   Google Scholar
• Orlin J. A faster strongly polynomial minimum cost flow algorithm. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing; New York, NY, USA. ACM; 1988. p. 377–387; STOC '88.
   Google Scholar