The maximum flows in bipartite dynamic networks with lower bounds. The static approach

In this paper we study maximum flow algorithms for bipartite dynamic networks with lower bounds. We resolve this problem by rephrasing into a problem in bipartite static network. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. In the final of the paper we present an example.