Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance

References

• E. Afrashteh, B. Alizadeh, and F. Baroughi, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, Opt. Methods Software 34(6) (2019), pp. 1213–1230. doi: 10.1080/10556788.2018.1482296
   Web of Science ®Google Scholar
• E. Afrashteh, B. Alizadeh, and F. Baroughi, Optimal algorithms for integer inverse undesirable p-median location problems on weighted extended star networks, J. Oper. Res. Soc. China (2018). doi:10.1007/s40305-018-0229-z.
   Google Scholar
• E. Afrashteh, B. Alizadeh, F. Baroughi, and K.T. Nguyen, Linear time optimal approaches for max-profit inverse 1-median location problems, Asia Pacific J. Oper. Res. 35(05) (2018), pp. 1850030. doi: 10.1142/S0217595918500306
   Google Scholar
• B. Alizadeh, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, Networks 58(3) (2011), pp. 190–200. doi: 10.1002/net.20427
   Web of Science ®Google Scholar
• B. Alizadeh and R.E. Burkard, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, Networks 58(3) (2011), pp. 190–200. doi: 10.1002/net.20427
   Web of Science ®Google Scholar
• B. Alizadeh and R.E. Burkard, Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees, Discrete Appl. Math. 159(8) (2011), pp. 706–716. doi: 10.1016/j.dam.2011.01.009
   Web of Science ®Google Scholar
• B. Alizadeh and R.E. Burkard, A linear time algorithm for inverse obnoxious center location problems on networks, Cent. Eur. J. Oper. Res. 21(3) (2013), pp. 585–594. doi: 10.1007/s10100-012-0248-5
   Web of Science ®Google Scholar
• B. Alizadeh and R. Etemad, The linear time optimal approaches for reverse obnoxious center location problems on networks, Optimization 65(11) (2016), pp. 2025–2036. doi: 10.1080/02331934.2016.1203915
   Web of Science ®Google Scholar
• B. Alizadeh and R. Etemad, Optimal algorithms for inverse vertex obnoxious center location problems on graphs, Theoret. Comput. Sci. 707 (2018), pp. 36–45. doi: 10.1016/j.tcs.2017.10.001
   Web of Science ®Google Scholar
• B. Alizadeh, E. Afrashteh, and F. Baroughi, Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks, J. Opt. Theory. Appl. 178(3) (2018), pp. 914–934. doi: 10.1007/s10957-018-1334-1
   Web of Science ®Google Scholar
• B. Alizadeh, E. Afrashteh, and F. Baroughi, Inverse obnoxious p-median location problems on trees with edge length modifications under different norms, Theoret. Comput. Sci. 772 (2019), pp. 73–87. doi: 10.1016/j.tcs.2018.11.020
   Web of Science ®Google Scholar
• B. Alizadeh, R.E. Burkard, and U. Pferschy, Inverse 1-center location problems with edge length augmentation on trees, Computing 86(4) (2009), pp. 331–343. doi: 10.1007/s00607-009-0070-7
   Web of Science ®Google Scholar
• F.B. Bonab, R.E. Burkard, and E. Gassner, Inverse p-median problems with variable edge lengths, Math. Methods Oper. Res. 73(2) (2001), pp. 263–280. doi: 10.1007/s00186-011-0346-5
   Google Scholar
• R.E. Burkard, C. Pleschiutschnig, and J. Zhang, Inverse median problems, Discrete Optim. 1(1) (2004), pp. 23–39. doi: 10.1016/j.disopt.2004.03.003
   Google Scholar
• R.E. Burkard, C. Pleschiutsching, and J. Zhang, The inverse 1-median problem on a cycle, Discrete Optim. 5 (2008), pp. 242–253. doi: 10.1016/j.disopt.2006.11.008
   Web of Science ®Google Scholar
• M.C. Cai, X.G. Yang, and J.Z. Zhang, The complexity analysis of the inverse center location problem, J. Global Optim. 15(2) (1999), pp. 213–218. doi: 10.1023/A:1008360312607
   Web of Science ®Google Scholar
• M. Galavii, The inverse 1-median problem on a tree and on a path, Electron. Notes Discrete Math. 36 (2010), pp. 1241–1248. doi: 10.1016/j.endm.2010.05.157
   Google Scholar
• E. Gassner, The inverse 1-maxian problem with edge length modification, J. Comb. Optim. 16 (2008), pp. 50–67. doi: 10.1007/s10878-007-9098-9
   Web of Science ®Google Scholar
• E. Gassner, An inverse approach to convex ordered median problems in trees, J. Comb. Optim. 23(2) (2012), pp. 261–273. doi: 10.1007/s10878-010-9353-3
   Web of Science ®Google Scholar
• A.J. Goldman, Optimal center location in simple networks, Transp. Sci. 5(2) (1979), pp. 212–221. doi: 10.1287/trsc.5.2.212
   Google Scholar
• X. Guan and B. Zhang, Inverse 1-median problem on trees under weighted Hamming distance, J. Glob. Optim. 54 (2012), pp. 75–82. doi: 10.1007/s10898-011-9742-x
   Web of Science ®Google Scholar
• R. Holzman, An axiomatic approach to location on networks, Math. Oper. Res. 15 (1990), pp. 553–563. doi: 10.1287/moor.15.3.553
   Web of Science ®Google Scholar
• L.K. Hua, Application of mathematical models to wheat harvesting, Chinese Math. 2 (1962), pp. 539–560.
   Google Scholar
• O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. I: The p-centers, SIAM J. Appl. Math. 37(3) (1979), pp. 513–538. doi: 10.1137/0137040
   Web of Science ®Google Scholar
• O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. II: The p-medians, SIAM J. Appl. Math. 37(3) (1979), pp. 539–560. doi: 10.1137/0137041
   Web of Science ®Google Scholar
• L. Liu, Inverse maximum flow problems under the combining norms, Lect. Notes Comput. Sci. 7924 (2013), pp. 221–230. doi: 10.1007/978-3-642-38756-2_23
   Google Scholar
• K.T Nguyen, Inverse 1-median problem on block graphs with variable vertex weights, J. Optim. Theory Appl. 168(3) (2016), pp. 944–957. doi: 10.1007/s10957-015-0829-2
   Web of Science ®Google Scholar
• K.T. Nguyen, Some polynomially solvable cases of the inverse ordered 1-median problem on trees, Filomat 31(12) (2017), pp. 3651–3664. doi: 10.2298/FIL1712651N
   Web of Science ®Google Scholar
• K.T. Nguyen, The inverse 1-center problem on cycles with variable edge lengths, Cent. Eur. J. Oper. Res. 27 (2017), pp. 263–274. doi: 10.1007/s10100-017-0509-4
   Web of Science ®Google Scholar
• K.T. Nguyen and L.Q. Anh, Inverse k-centrum problem on trees with variable vertex weights, Math. Meth. Oper. Res. 82(1) (2015), pp. 19–30. doi: 10.1007/s00186-015-0502-4
   Web of Science ®Google Scholar
• K.T. Nguyen and A. Chassein, The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance, Eur. J. Oper. Res. 247(3) (2015), pp. 774–781. doi: 10.1016/j.ejor.2015.06.064
   Web of Science ®Google Scholar
• K.T. Nguyen and N.T.L Chi, A model for the inverse 1-median problem on trees under uncertain costs, Opuscula Math. 36 (2016), pp. 513–523. doi: 10.7494/OpMath.2016.36.4.513
   Web of Science ®Google Scholar
• K.T. Nguyen and A.R. Sepasian, The inverse 1-center problem on trees under Chebyshev norm and Hamming distance, J. Comb. Optim. 32(3) (2015), pp. 872–884. doi: 10.1007/s10878-015-9907-5
   Web of Science ®Google Scholar
• K.T. Nguyen and P. Vui, The inverse p-maxian problem on trees with variable edge lengths, Taiwanese J. Math. 20(6) (2016), pp. 1437–1449. doi: 10.11650/tjm.20.2016.6296
   Web of Science ®Google Scholar
• K.T. Nguyen, H. Nguyen-Thu, and N.T. Hung, On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks, Math. Methods Oper. Res. 88(2) (2018), pp. 147–159. doi: 10.1007/s00186-018-0632-6
   Web of Science ®Google Scholar
• K.T. Nguyen, H. Nguyen-Thu, and N.T. Hung, Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees, Acta Math. Vietnam. 44(4) (2019), pp. 813–831. doi:10.1007/s40306-018-0286-8
   Web of Science ®Google Scholar
• K.T. Nguyen, N.T. Hung, H. Nguyen-Thu, T.T. Le, and V.H. Pham, On some inverse 1-center location problems, Optimization 68(5) (2019), pp. 999–1015. doi:10.1080/02331934.2019.1571056
   Web of Science ®Google Scholar
• N. Megiddo, Linear-time algorithms for linear programming in R3 and related problems, SIAM J. Comput. 12(4) (1983), pp. 759–776. doi: 10.1137/0212052
   Web of Science ®Google Scholar
• A.R. Sepasian and F. Rahbarnia, An O(nlog⁡n) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions, Optimization 64 (2015), pp. 595–602.
   Web of Science ®Google Scholar
• X. Yang and J.Z Zhang, Inverse center location problem on a tree, J. Syst. Sci. Complex. 21(4) (2008), pp. 651–664. doi: 10.1007/s11424-008-9142-6
   Web of Science ®Google Scholar