INTEGER REVERSE OBNOXIOUS MEDIAN LOCATION MODEL ON TREE NETWORKS

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 modifi_x000C_cation budget with respect to modi_x000C_fication 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 fi_x000C_rst approaches, we develop novel algorithms approaches for solving the problem on tree networks under the rectilinear and the Chebyshev cost norms.