[1] Aron, I., Van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32, 36–40 (2003)

[2] Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12, 104–110 (2000)

[3] Averbakha, I., Bereg, S.: Facility location problems with uncertainty on the plane. Discret. Optim. 2, 3–34 (2005)

[4] Averbakh, I., Lebedevb, V.: Interval data minmax regret network optimization problems. Discret. Appl. Math. 138, 289–301 (2004)

[5] Bachtler, O., Krumke, S.O., Le, H.M.: Robust single machine makespan scheduling with release date uncertainty. Oper. Res. Lett. 48, 816–819 (2020)

[6] Ben-Tal, A., Nemirovski, A., El-Ghaoui, L.: Robust Optimization. Princeton University Press, Princeton (2009)

[7] Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret 1-median on a tree network. Algorithmica 70, 2–21 (2014)

[8] Burkard, R.E., Dollani, H.: Robust location problems with pos/neg weights on a tree. Networks 38, 102–113 (2001)

[9] Chassein, A., Goerigk, M.: Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. 264, 17–28 (2018)

[10] Chen, B., Lin, C.S.: Minmax-regret robust 1-median location on a tree. Networks 31, 93–103 (1998)

[11] Conde, E.: A note on the minmax regret centdian location on trees. Oper. Res. Lett. 36, 271–275 (2008)

[12] Davoodi, M.: k-balanced center location problem: a new multi-objective facility location problem. Comput. Oper. Res. 105, 68–84 (2019)

[13] Drezner, Z., Hamacher, H.W.: Facility Location - Applications and Theory. Springer, Heidelberg (2002)

[14] Drwal, M.: Min-max regret scheduling to minimize the total weight of late jobs with interval uncertainty. In: International Conference on Optimization and Decision Science 2017, pp. 611–619 (2017)

[15] Galavec, M., Hudec, O.: Balanced location on a graph. Optimization 35, 367–372 (1995)

[16] Ghobadi, K., Lee, T., Mahmoudzadeh, H., Terekhov, D.: Robust inverse optimization. Oper. Res. Lett. 46, 339–344 (2018)

[17] Kasperski, A., Makuchowski, M., Zieliński, P.: A tabu search algorithm for the minimax regret minimum spanning tree problem with interval data. J. Heuristics 18(4), 593–625 (2012)

[18] Kasperski, A., Zieliński, P.: Minmax (regret) scheduling problems. In: Sotskov, Y.N., Werner, F. (eds.) Book in Applied Statistica Science: Sequencing and Scheduling with Inaccurate Data. Nova Science Publishers, New York (2014)

[19] Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Hingham (1997)

[20] Liao, W., Fu, Y.: Min-max regret criterion-based robust model for the permutation flow-shop scheduling problem. Eng. Optim. 52, 687–700 (2020)

[21] Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31, 1667–1680 (2004)

[22] Montemanni, R., Gambardella, L.M.: A branch and bound algorithm for robust spanning tree problem with interval data. Oper. Res. Lett. 161, 771–779 (2005)

[23] Montemanni, R., Gambardella, L.M., Donati, A.V.: A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32, 225–232 (2004)

[24] Nguyen, K.T., Hung, N.T.: The minmax regret inverse maximum weight problem. Appl. Math. Comput. 407, 126328 (2021)

[25] Omidi, S., Fathali, J.: Inverse single facility location problem on a tree with balancing on the distance of server to clients. J. Ind. Manag. Optim. (2021). https://doi.org/10.3934/jimo.2021017

[26] Pham, V.H., Nguyen, K.T., Le, T.T.: A linear time algorithm for balance vertices on trees. Discret. Optim. 32, 37–42 (2019)

[27] Puerto, J., Rodriguez-Chia, A.M., Tamir, A.: Minimax regret single facility ordered median location problems on networks. INFORMS J. Comput. 21, 77–87 (2019)

[28] Reid, K.B.: Balance vertices in trees. Networks 34, 264–271 (1999)

[29] Reid, K.B., DePalma, E.: Balance in trees. Discret. Math. 304, 34–44 (2005)

[30] Shan, E., Kang, L.: A note on balance vertices in trees. Discret. Math. 280, 265–269 (2004)

[31] Ye, J.H., Wang, B.F.: On the minmax regret path median problem on trees. J. Comput. Syst. Sci. 81, 1159–1170 (2015)

[32] Zieliński, P.: The computational complexity of the relative robust shortest path problem with interval data. Eur. J. Oper. Res. 158, 570–576 (2004)