An algorithm for solving the bi-objective median path-shaped facility on a tree network

Aboutahoun, A. W., El-Safty, F.: A linear algorithm for a minimax location of a path-shaped facility with a specific length in a weighted tree network. Int. J. Oper. Res. 1. https://doi.org/10.1504/IJOR.2021.10016889.

Alizadeh, B., Etemad, R.: Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization. 65, 2025–2036 (2016).

Averbakh, I., Berman, O.: Algorithms for path medi-centers of a tree. Comput. Oper. Res.26, 1395–1409 (1999).

Becker, R. I.: Inductive algorithms on finite trees. Quaest. Math.13, 165–181 (1990).

Becker, R. I., Chang, Y. I., Lari, I., Scozzari, A., Strochi, G.: Finding the ℓ-core of a tree. Discrete Appl. Math. 118, 25–42 (2002).

Becker, R. I., Lari, I., Scozzari, A.: Algorithms for central-median paths with bounded length on trees. European J. Oper. Res. 179, 1208–1220 (2007).

Bhattacharya, B., Shi, Q., Tamir, A.: Optimal algorithm for the path/tree shaped facility location problems on trees. Algorithmica. 55, 601–618 (2009).

Chankong, V., Haimes, Y. Y.: Multiobjective decision making: theory and methodology. Dover publications, New York (2008).

Colebrook, M., Sicilia, J.: A ploynomial algorithm for the multicriteria cent-dian location problem. European J. Oper. Res. 179, 1008–1024 (2007).

Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005).

Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34, 2674–2694 (2007).

Ghezavati, V., Hosseinifar, P.: Application of efficient metaheuristics to solve a new bi-objective optimization model for hub facility location problem considering value at risk criterion. Soft Comput. 22, 195–212 (2016).

Goldman, A. J.: Optimum center location in simple networks. Transport. Sci. 5, 212–221 (1971).

Hamacher, H. W., Labbe, M., Nickel, S.: Multicriteria network location problems with sum objectives. Networks. 33, 79–92 (1999).

Hassin, R., Ravi, R., Salman, F. S.: Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34, 931–955 (2017).

Kahag, M. R., Niaki, S. T. A., Seifbarghy, M., Zabihi, S.: Bi-objective optimization of multi-server intermodel hub-location-allocation problem in congested systems: modeling and solution. J. Ind. Eng. Int. 15, 221–248 (2019).

Kariv, O., Hakimi, S. L.: An algorithmic approach to network location problems, Part I, The p-centers. SIAM J. Appl. Math. 37, 513–538 (1979).

Mahmoud, M. R., Fahmy, H., Labadie, J. W.: Multicriteria siting and sizing of desalination facilities with geographic information system. J. Water Res. Pl- ASCE. 128, 113–120 (2002).

Minieka, E., Patel, N. H.: On finding the core of a tree with a specified length. J. Algorithms. 4, 345–352 (1983).

Morgan, C. A., Slater, P. J.: A linear algorithm for a core of a tree. J. Algorithms. 1, 247–258 (1980).

Nguyen, K., Vui, P.: The inverse p-maxian problem on trees with variable edge lengths. Taiwanese J. Math. 20, 1437–1449 (2016).

Peng, S., Lo, W.: Efficient algorithms for finding a core of a tree with specified length. J. Algorithms. 20, 445–458 (1996).

Puerto, J., Rodrigues-Chia, A. M., Tamir, A., Perez-Brito, D.: The bi-criteria doubly weighted center-median path problem on a tree. Networks. 47, 237–247 (2006).

Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36, 1299–1331 (2009).

Raith, A., Ehrgott, M.: A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36, 1945–1954 (2009).

Ramos, R. M., Ramos, M. T., Colebrook, M., Sicilia, J.: Locating a facility on a network with multiple median-type objectives. Ann. Oper. Res. 86, 221–235 (1999).

Rana, R., Garg, D.: Algorithm for obnoxious facility location problem. Int. J. Adv. Technol. 5, 96–106 (2014).

Slater, P. J.: Locating central paths in a graph. Transport. Sci. 16, 1–18 (1982).

Steiner, S., Radzik, T.: Computing all efficient solutions of the biobjective minimum spanning tree problem. Comput. Oper. Res. 35, 198–211 (2008).

Tamir, A., Puerto, J., Mesa, J. A., Rodriguez-Chia, A. M.: Conditional location of path and tree shaped facilities on trees. J. Algorithms. 56, 50–75 (2005).

Tamir, A., Puerto, J., Perez-Brito, D.: The centdian subtree on tree network. Discrete Appl. Math. 118, 263–278 (2002).

Ulungu, E. L., Teghem, J.: The two-phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decision Sci. 20, 149–165 (1995).

Wang, H. L.: An optimal algorithm for the weighted backup 2-center problem on a tree. Algorithmica. 77, 426–439 (2017).

Zaferanieh, M., Fathali, J.: Finding a core of a tree with pos/neg weight. Math. Meth. Oper. Res. 76, 147–160 (2012).