A modified algorithm for solving the inverse minimum cost ow problem under the bottleneck-type Hamming distance

Abstract

Given an instance of the minimum cost flow problem, the corresponding inverse problem is to modify the arc costs as little as possible so that a given feasible ow becomes optimal to the modified minimum cost ow problem. In this article, we study this inverse problem in that the modifications are measured by the weighted bottleneck-type Hamming distance. We present a new efficient algorithm to solve the inverse problem. Finally, we theoretically compare the proposed algorithm with the previous one.