Inverse maximum ow problem in planar networks
DOI:
https://doi.org/10.31926/but.mif.2019.12.61.1.10Keywords:
inverse combinatorial optimization and maximum flow and planar networks and strongly polynomial timeAbstract
In this paper, we consider the problem of inverse maximum ow in the planar network (IMFPN), where upper bounds for the ow must be changed as little as possible so that a given feasible flow becomes a maximum ow in the modified network. A strongly polynomial algorithm for solving this problem is proposed.
