Jiang, Yiwei; Liu, Longcheng; Wu, Biao; Yao, Enyu - In: European Journal of Operational Research 207 (2010) 1, pp. 50-54
Given a network N(V, A, u, c) and a feasible flow x0, an inverse minimum cost flow problem is to modify the cost vector as little as possible to make x0 form a minimum cost flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse minimum...