integer reverse obnoxious median facility location models on tree graphs

This paper is concerned with the integer reverse obnoxious median location model on tree networks in which the aim is to modify the edge lengths by integer amounts within a given modification budget with respect to modification bounds until a set of predetermined obnoxious facility locations becomes as far as possible from the customer points under the new edge lengths. as the first approaches, we develop novel algorithms approaches for solving the problem on tree networks under the rectilinear and the chebyshev cost norms.