TY - JOUR
ID - 27767
TI - The inverse 1-median problem on a tree with transferring the weight of vertices
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Sayar, Tahere
AU - Fathali, Jafar
AU - Ghiyasi, Mojtaba
AD - Faculty of Mathematical Sciences, Shahrood University of Technology, University Blvd., Shahrood, Iran.
AD - Faculty of Mathematical Sciences, Shahrood University of Technology, University Blvd., Shahrood, Iran
AD - Department of Management and Accounting, Faculty of Industrial Engineering and Management Sciences,
Shahrood University of Technology, Shahrood, Iran.
Y1 - 2024
PY - 2024
VL - 13
IS - 4
SP - 335
EP - 350
KW - median problem
KW - inverse optimization
KW - location models
DO - 10.22108/toc.2023.136964.2047
N2 - In this paper, we investigate a case of the inverse 1-median problem on a tree by transferring the weights of vertices which has not been raised so far. This problem considers modifying the weights of vertices via transferring weights of the vertices with the minimum cost such that a given vertex of the tree becomes the 1-median with respect to the new weights. A linear programming model is proposed for this problem. The applicability and efficiency of the presented model are shown in numerical examples and a real-life problem dealing with transferring users in a social network.
UR - https://toc.ui.ac.ir/article_27767.html
L1 - https://toc.ui.ac.ir/article_27767_8be004d2de59d9bb64f37acecec2f724.pdf
ER -