Inverse vertex obnoxious center location problems on networks

In an inverse vertex obnoxious center location problem, the aim is to modify the edge lengths at minimum total cost with respect to the modification bounds such that a predetermined vertex becomes a vertex obnoxious center location under the new edge lengths. We develop a linear time combinatorial method for the problem with edge length augmentation. For the reduction case, an algorithm with cubic running time is devised

کلیدواژه ها:

Obnoxious center location ، Combinatorial optimization ، Inverse optimization ، Time complexity