Inverse maximum flow problem in planar networks

Abstract

In this paper we consider the problem of inverse maximum flow in planar network (IMFPN), where upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a maximum flow in the modified network. A strongly polynomial algorithm for solving this problem is proposed. 2000 Mathematics Subject Classification: 90C27, 90C35, 68R10