This paper concerns the problem of modifying edge lengths of a network at minimum total costs so as to make a prespecified vertex become an optimal location in the modified environment. Here, we focus on the ordered median objective function with respect to the vector of multipliers $\lambda = (1,\ldots,1,0,\ldots,0)$ with $k$ 1's. This problem is called the inverse anti-$k$-centrum problem. We first show that the inverse anti-$k$-centrum problem is NP-hard even on tree networks. However, for the inverse anti-$k$-centrum problem on cycles, we formulate it as one or two linear programs, depending on odd or even integer $k$. Concerning the special cases with $k = 2,3,M$, we develop combinatorial algorithms that efficiently solve the problem, where $M$ is the number of vertices of the cycle.
"Inverse Anti-$k$-centrum Problem on Networks with Variable Edge Lengths." Taiwanese J. Math. 24 (2) 501 - 522, April, 2020. https://doi.org/10.11650/tjm/190602