EXACT ALGORITHMS FOR MAXIMUM-PROFIT INVERSE MEDIAN LOCATION OPTIMIZATION

This paper is concerned with a new variant of the inverse median location problem in which the aim is to modify the customer weights such that a predetermined facility location becomes a median location and the total profit obtained via the weight improvements is maximized. We develop a novel combinatorial approaches with linear time complexities for solving the problem on tree networks ‎and in the plane ‎under the rectilinear norm. Our proposed approaches are the first exact linear time solution methods on this issue.