×
Toan, Nguyen Thanh; Le, Huy Minh; Nguyen, Kien Trung

The reverse selective balance center location problem on trees. (English) Zbl 07814743

Opsearch 61, No. 1, 483-497 (2024).

MSC:

90Bxx Operations research and management science
90B80 Discrete location and assignment
90C35 Programming involving graphs or networks
90C27 Combinatorial optimization

Keywords:

location problem; reverse location; balanced facility; selective network; tree
Cite Review PDF
Full Text: DOI

References:

[1] Alizadeh, B.; Bakhteh, S., A modified firefly algorithm for general inverse \(p\)-median location problems under different distance norms, Opsearch, 54, 3, 618-636, 2017 · Zbl 1397.90406 · doi:10.1007/s12597-016-0296-z
[2] Arora, S.; Arora, SR, Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional, Opsearch, 43, 1, 18-30, 2006 · Zbl 1153.90479 · doi:10.1007/BF03398757
[3] Baroughi Bonab, F.; Burkard, RE; Alizadeh, B., Inverse median location problems with variable coordinates, CEJOR, 18, 3, 365-381, 2010 · Zbl 1204.90059 · doi:10.1007/s10100-009-0114-2
[4] Berman, O.; Drezner, Z.; Tamir, A.; Wesolowsky, GO, Optimal location with equitable loads, Ann. Oper. Res., 167, 1, 307-325, 2009 · Zbl 1163.90591 · doi:10.1007/s10479-008-0339-9
[5] Berman, O.; Ingco, DI; Odoni, A., Improving the location of minisum facilities through network modification, Ann. Oper. Res., 40, 1, 1-16, 1992 · Zbl 0787.90035 · doi:10.1007/BF02060467
[6] Berman, O.; Ingco, DI; Odoni, A., Improving the location of minimax facilities through network modification, Networks, 24, 1, 31-41, 1994 · Zbl 0799.90074 · doi:10.1002/net.3230240105
[7] Burkard, RE; Pleschiutschnig, C.; Zhang, JZ, Inverse median problems, Discret. Optim., 1, 1, 23-39, 2004 · Zbl 1087.90038 · doi:10.1016/j.disopt.2004.03.003
[8] Dzator, M.; Dzator, J., An effective heuristic for the \(p\)-median problem with application to ambulance location, Opsearch, 50, 1, 60-74, 2012 · Zbl 1353.90179 · doi:10.1007/s12597-012-0098-x
[9] Etemad, R.; Alizadeh, B., Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs, J. Oper. Res. Soc. China, 5, 1, 347-361, 2017 · Zbl 1387.90111 · doi:10.1007/s40305-016-0144-0
[10] Etemad, R.; Alizadeh, B., Reverse selective obnoxious center location problems on tree graphs, Math. Methods Oper. Res., 87, 3, 431-450, 2018 · Zbl 1391.90372 · doi:10.1007/s00186-017-0624-y
[11] Fathali, J.; Zaferanieh, M., The balanced 2-median and 2-maxian problems on a tree, J. Comb. Optim., 45, 2, 69, 2023 · Zbl 1514.90235 · doi:10.1007/s10878-023-00997-9
[12] Gavalec, M.; Hudec, O., Balanced location on a graph, Optimization, 35, 4, 367-372, 1995 · Zbl 0874.90114 · doi:10.1080/02331939508844156
[13] Karger, DR, Minimum cuts in near-linear time, J. ACM, 47, 1, 46-76, 2000 · Zbl 1094.68613 · doi:10.1145/331605.331608
[14] Marín, A., The discrete facility location problem with balanced allocation of customers, Eur. J. Oper. Res., 210, 1, 27-38, 2011 · Zbl 1207.90071 · doi:10.1016/j.ejor.2010.10.012
[15] Nazari, M.; Fathali, J., Inverse and reverse 2-facility location problems with equality measures on a network, Iran. J. Math. Sci. Inf., 18, 1, 211-225, 2023 · Zbl 1518.90046
[16] Nguyen, KT, Reverse 1-center problem on weighted trees, Optimization, 65, 1, 253-264, 2016 · Zbl 1332.90052 · doi:10.1080/02331934.2014.994626
[17] Nguyen, KT; Hung, NT, The reverse total weighted distance problem on networks with variable edge lengths, Filomat, 35, 4, 1333-1342, 2021 · doi:10.2298/FIL2104333N
[18] Omidi, S.; Fathali, J., Inverse single facility location problem on a tree with balanced on the distance of server to clients, J. Ind. Manag. Optim., 18, 2, 1247-1259, 2022 · Zbl 1499.90116 · doi:10.3934/jimo.2021017
[19] Omidi, S.; Fathali, J.; Nazari, M., Inverse and reverse balanced facility location problems with variable edge lengths on trees, Opsearch, 57, 261-273, 2020 · Zbl 07319739 · doi:10.1007/s12597-019-00428-6
[20] Pham, VH; Nguyen, KT; Le, TT, A linear time algorithm for balance vertices on trees, Discret. Optim., 32, 37-42, 2019 · Zbl 1506.90262 · doi:10.1016/j.disopt.2018.11.001
[21] Sepasian, AR, Reverse 1-maxian problem with keeping existing 1-median, Opsearch, 56, 1-13, 2019 · Zbl 07044875 · doi:10.1007/s12597-018-0348-7
[22] Sepasian, AR; Rahbarnia, F., An O(nlogn) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions, Optimization, 64, 3, 595-602, 2015 · Zbl 1308.90028
[23] Sepasian, AR; Tayyebi, J., Further study on reverse 1-center problem on trees, Asia-Pacific J. Oper. Res.., 37, 2050034, 2020 · Zbl 1461.90025 · doi:10.1142/S0217595920500347
[24] Tayyebi, J.; Reza Sepasian, A., Reverse 1-centre problem on trees under convex piecewise-linear cost function, Optimization, 72, 3, 843-860, 2023 · Zbl 1515.90145 · doi:10.1080/02331934.2021.1995730
[25] Wang, H.; Li, H.; Wang, M.; Cui, J., Toward balancing the efficiency and effectiveness in k-facility relocation problem, ACM Trans. Intell. Syst. Technol., 14, 3, 1-24, 2023 · doi:10.1145/3587039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.