Maximum balanced flow in a network
type: Item
instance of: scholarly article
title: Maximum balanced flow in a network
zbMATH Open document ID: 1025.05048
author: Haggai Ilani
author: Michael V. Lomonosov
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1464306
zbMATH Keywords: balanced flow
zbMATH Keywords: matchings
zbMATH Keywords: multiflow optimization
MaRDI profile type: Publication
full work available at URL: jctb.1999.1940
OpenAlex ID: W2093485431
cites work: Q3258698
cites work: Q5514188
cites work: On Integer Multiflow Maximization
cites work: A theorem on flows in networks
cites work: Q4845365
cites work: On extremal multiflows
cites work: Q3680844
cites work: Combinatorial approaches to multiflow problems
cites work: Matching theory
cites work: Q3330973
cites work: The Factors of Graphs
cites work: A Short Proof of the Factor Theorem for Finite Graphs
DOI: 10.1006/JCTB.1999.1940
Recommended article: The maximum flow in dynamic networks
Recommended article: A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
Recommended article: Algorithms for maximum network flow
Recommended article: Maximum flow problem in the distribution network
Recommended article: A Method for Obtaining the Maximum (δ,η)-Balanced Flow in a Network
Recommended article: Balancing Applied to Maximum Network Flow Problems
Recommended article: On the Maximum Expected Flow in a Network
Recommended article: Ratio-balanced maximum flows
Recommended article: Maximum network flows with concave gains
Recommended article: Balanced graphs and network flows
description: scientific article; zbMATH DE number 1464306