Inverse Minisum Location Problems with Variable Coordinates

In this work, we consider the inverse minisum location problem with variable coordinates in ddimensional real space in which the aim is to increase or decrease the coordinates of a set of given points at minimum total cost with respect to modification bounds such that a predetermined point becomes a minisum location. We develop polynomial time and pseudo-polynomial time solution algorithms for the problem under the rectilinear, the squared Euclidean and the Chebyshev distance norms. Moreover, we discuss the NPhardness of the models under investigation