Optimal Algorithms for Inverse Center Location Problem with Cardinality Constraint on Tree Networks

In a cardinality constrained inverse center location problem on a network, the goal is to modify the edge lengths at the minimum total cost with respect to the given modification bounds so that a prespecified vertex s becomes an absolute center location under the newedge lengths and the number of the modified edge lengths obeys an upper bound. The novel optimal algorithms with lower time complexities are developed for the problem on tree networks under different cost norms.

کلیدواژه ها:

Center location problems ، Inverse optimization ، Combinatorial optimization ، Time complexity