Budget-constrained inverse median facility location problem on tree networks

摘要

This paper is concerned with the budget-constrained inverse median facility location problem on networks, in which the underlying vertex set is considered as customer points and the aim is to modify the vertex weights at the minimum overall cost subject to specific modification bounds and an associated budget such that a predetermined vertex becomes an optimal median facility location under the perturbed vertex weights. We develop novel combinatorial algorithms for deriving the optimal solutions of the problem on tree networks under different cost norms.