On some inverse 1-center location problems

References

• Kariv O, Hakimi SL. An algorithmic approach to network location problems, I. the p-centers. SIAM J Appl Math. 1979;37:513–538. doi: 10.1137/0137040
   Web of Science ®Google Scholar
• Kariv O, Hakimi SL. An algorithmic approach to network location problems, II. the p-medians. SIAM J Appl Math. 1979;37:536–560.
   Web of Science ®Google Scholar
• Hamacher HW. Mathematische Lösungsverfahren Für planare standortprobleme. Braunschweig: Vieweg and Teubner; 1995.
   Google Scholar
• Burkard RE, Pleschiutschnig C, Zhang JZ. Inverse median problems. Discrete Optim. 2004;1:23–39. doi: 10.1016/j.disopt.2004.03.003
   Google Scholar
• Galavii M. The inverse 1-median problem on a tree and on a path. Electron Notes Discrete Math. 2010;36:1241–1248. doi: 10.1016/j.endm.2010.05.157
   Google Scholar
• Sepasian AR, Rahbarnia F. An O(nlog⁡n) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization. 2015;64:595–602.
   Web of Science ®Google Scholar
• Nguyen KT. Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl. 2016;168:944–957. doi: 10.1007/s10957-015-0829-2
   Web of Science ®Google Scholar
• Burkard RE, Galavii M, Gassner E. The inverse Fermat-Weber problem. Eur J Oper Res. 2010;206:11–17. doi: 10.1016/j.ejor.2010.01.046
   Web of Science ®Google Scholar
• Burkard RE, Pleschiutschnig C, Zhang JZ. The inverse 1-median problem on a cycle. Discrete Optim. 2008;5:242–253. doi: 10.1016/j.disopt.2006.11.008
   Web of Science ®Google Scholar
• Bonab FB, Burkard RE, Gassner E. Inverse p-median problems with variable edge lengths. Math Methods Oper Res. 2011;73:263–280. doi: 10.1007/s00186-011-0346-5
   Web of Science ®Google Scholar
• Alizadeh B, Bakhteh S. A modified firefly algorithm for general inverse p-median location problems under different distance norms. OPSEARCH. 2017;54:618–636. doi: 10.1007/s12597-016-0296-z
   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;178:914–934. doi: 10.1007/s10957-018-1334-1
   Web of Science ®Google Scholar
• Cai MC, Yang XG, Zhang JZ. The complexity analysis of the inverse center location problem. J Global Optim. 1999;15:213–218. doi: 10.1023/A:1008360312607
   Web of Science ®Google Scholar
• Alizadeh B, Burkard RE. Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks. 2011;58:190–200. doi: 10.1002/net.20427
   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:706–716. doi: 10.1016/j.dam.2011.01.009
   Web of Science ®Google Scholar
• Alizadeh B, Burkard RE, Pferschy U. Inverse 1-center location problems with edge length augmentation on trees. Computing. 2009;86:331–343. doi: 10.1007/s00607-009-0070-7
   Web of Science ®Google Scholar
• Nguyen KT, Chassein A. Inverse eccentric vertex problem on networks. Central Eur J Oper Res. 2015;23:687–698. doi: 10.1007/s10100-014-0367-2
   Web of Science ®Google Scholar
• Nguyen KT, Anh LQ. Inverse k-centrum problem on trees with variable vertex weights. Math Methods Oper Res. 2015;82:19–30. doi: 10.1007/s00186-015-0502-4
   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;32:872–884. doi: 10.1007/s10878-015-9907-5
   Web of Science ®Google Scholar
• Gassner E. An inverse approach to convex ordered median problems in trees. J Comb Optim. 2012;23:261–273. doi: 10.1007/s10878-010-9353-3
   Web of Science ®Google Scholar
• Nguyen KT. Some polynomially solvable cases of the inverse ordered 1-median problem on trees. FILOMAT. 2017;31:3651–3664. doi: 10.2298/FIL1712651N
   Web of Science ®Google Scholar
• Nguyen KT, Chassein A. The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur J Oper Res. 2015;247:774–781. doi: 10.1016/j.ejor.2015.06.064
   Web of Science ®Google Scholar
• Golumbic MC. Algorithmic graph theory and perfect graphs. New York: Academic Press; 1980.
   Google Scholar
• Panda BS, Das SK. A linear time recognition algorithm for proper interval graphs. Inf Process Lett. 2003;87:153–161. doi: 10.1016/S0020-0190(03)00298-9
   Web of Science ®Google Scholar
• Bespamyatnikh S, Bhattacharya B, Keil M, et al. Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks. 2002;39:144–152. doi: 10.1002/net.10023
   Web of Science ®Google Scholar
• Cheng TCE, Kang L, Ng CT. An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput & Oper Res. 2007;34:2215–2222. doi: 10.1016/j.cor.2005.08.013
   Web of Science ®Google Scholar