Maximum balanced flow in a network
From MaRDI portal
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)].
Recommendations
- The maximum flow in dynamic networks
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
- Algorithms for maximum network flow
- Maximum flow problem in the distribution network
- A method for obtaining the maximum ( , )-balanced flow in a network
- Balancing Applied to Maximum Network Flow Problems
- On the Maximum Expected Flow in a Network
- Ratio-balanced maximum flows
- Maximum network flows with concave gains
- Balanced graphs and network flows
Cites work
- A Short Proof of the Factor Theorem for Finite Graphs
- A theorem on flows in networks
- Combinatorial approaches to multiflow problems
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3902670 (Why is no real title available?)
- scientific article; zbMATH DE number 795216 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- Matching theory
- On extremal multiflows
- On Integer Multiflow Maximization
- The Factors of Graphs
Cited in
(5)
This page was built for publication: Maximum balanced flow in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569079)
