Balanced network flows. III. Strongly polynomial augmentation algorithms

DOI10.1002/(SICI)1097-0037(199901)33:1%3C43::AID-NET3%3E3.0.CO;2-6MaRDI QIDQ4540088zbMATH OpenOpenAlexFDO

Authors Christian Fremuth-Paeger, Dieter Jungnickel

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199901)33:1%3C43::aid-net3%3E3.0.co;2-6

zbMATH Keywords

augmenting pathsbalanced flow networksmatching problemsnetwork flowsstrongly polynomial algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1769331
• A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
• scientific article; zbMATH DE number 842873
• scientific article; zbMATH DE number 1769330
• A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION

Cites work

• Balanced network flows. IV: Duality and structure theory.
• scientific article; zbMATH DE number 1101952 (Why is no real title available?)
• Paths, Trees, and Flowers

Cited in

(14)

• A strongly polynomial algorithm for the uniform balanced network flow problem
• Balanced network flows. IV: Duality and structure theory.
• Balanced network flows. V: Cycle-canceling algorithms.
• Balanced network flows. VI: Polyhedral descriptions.
• Balanced network flows. VII: Primal-dual algorithms.
• A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
• Layered Augmenting Path Algorithms
• scientific article; zbMATH DE number 1769330 (Why is no real title available?)
• scientific article; zbMATH DE number 1769331 (Why is no real title available?)
• Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O( $\bf\it\sqrt{n}m$ log(n²/m)/log n) bound for the nonbipartite cardinality matching problem
• scientific article; zbMATH DE number 842873 (Why is no real title available?)
• Balancing Applied to Maximum Network Flow Problems
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Balanced network flows. III. Strongly polynomial augmentation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540088)