Inverse Extensive Mini-Max Facility Location Optimization on Tree Graphs

In this paper , we consider the inverse extensive absolute and vertex mini-max facility location problems on a tree graph T in which the goal is to increase or reduce the edge lengths of T in the cheapest possible way subject to given modification bounds such that a candidate point on the tree becomes an extensive absolute (or extensive vertex) mini-max facility location . The exact solution algorithms are developed to solve the problems under investigation in polynomial times