Maximum balanced flow in a network
A ``parity problem'' for a network flow is posed, and solved by reducing it to the \(b\)-matching problem in a graph. The result is claimed to be instrumental in some interesting cases of integer multiflow optimization; these applications are given in \textit{H. Ilani}, \textit{E. Korach} and \textit{M. Lomonosov} [J. Comb. Theory, Ser. B 79, 183-210 (2000; Zbl 1025.05049)].
scientific article; zbMATH DE number 1464306
scientific article