The inverse 1-median problem on a tree with transferring the weight of vertices
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
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.
Keywords:
Language:
English
Published:
Transactions on Combinatorics, Volume:13 Issue: 4, Dec 2024
Pages:
335 to 350
https://www.magiran.com/p2662573
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Algorithmic complexity of triple Roman dominating functions on graphs
Abolfazl Poureidi *,
Communications in Combinatorics and Optimization, Spring 2024 -
Inverse and Reverse 2-facility Location Problems with Equality Measures on a Network
Morteza Nazari, *
Iranian Journal of Mathematical Sciences and Informatics, May 2023