In the classical minisum facility location problem, the goal is to find the placement of a new facility that minimizes the sum of weighted distances to a given set of client points. In contrast, the reverse minisum single facility location problem assumes a fixed facility location and focuses on adjusting the weights of the client points. The objective is to improve the weighted distances between the facility and clients, subject to a budget constraint on weight modifications. This paper introduces an $O(n\log n)$ algorithm for the reverse problem with variable weights, applicable to both network and continuous location models. Experimental results on diverse instances demonstrate the algorithm's effectiveness.
Tour-Savadkoohi,N. and Fathali,J. (2025). Reverse minisum single facility location problem with variable weights. Journal of Frame and Matrix Theory, 2(2), 22-34. doi: 10.22034/jfmt.2025.512686.1026
MLA
Tour-Savadkoohi,N. , and Fathali,J. . "Reverse minisum single facility location problem with variable weights", Journal of Frame and Matrix Theory, 2, 2, 2025, 22-34. doi: 10.22034/jfmt.2025.512686.1026
HARVARD
Tour-Savadkoohi N., Fathali J. (2025). 'Reverse minisum single facility location problem with variable weights', Journal of Frame and Matrix Theory, 2(2), pp. 22-34. doi: 10.22034/jfmt.2025.512686.1026
CHICAGO
N. Tour-Savadkoohi and J. Fathali, "Reverse minisum single facility location problem with variable weights," Journal of Frame and Matrix Theory, 2 2 (2025): 22-34, doi: 10.22034/jfmt.2025.512686.1026
VANCOUVER
Tour-Savadkoohi N., Fathali J. Reverse minisum single facility location problem with variable weights. JFMT, 2025; 2(2): 22-34. doi: 10.22034/jfmt.2025.512686.1026
