Maximum balanced flow in a network

DOI10.1006/JCTB.1999.1940zbMATH Open1025.05048OpenAlexW2093485431MaRDI QIDQ1569079FDOQ1569079

Authors: Haggai Ilani, Michael V. Lomonosov 

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1940

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 \((\delta ,\eta )\)-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

zbMATH Keywords

matchingsbalanced flowmultiflow optimization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• Title not available (Why is that?)
• A theorem on flows in networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Short Proof of the Factor Theorem for Finite Graphs
• The Factors of Graphs
• Combinatorial approaches to multiflow problems
• On Integer Multiflow Maximization
• Title not available (Why is that?)
• On extremal multiflows

Cited In (4)

• Balanced network flows. VI: Polyhedral descriptions.
• Title not available (Why is that?)
• On extremal multiflows
• Title not available (Why is that?)

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)