Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks

Abstract

This article deals with the inverse obnoxious center location problem on general networks in which the edge lengths are modified at the minimum overall cost with respect to given modification bounds such that a predetermined facility point becomes an obnoxious center location under the modified edge lengths on the perturbed network. Exact combinatorial algorithms with linear time complexities are developed for obtaining the optimal solutions of the problem under the weighted Chebyshev, bottleneck-type Hamming and sum-type Hamming cost norms.