Balanced network flows. III. Strongly polynomial augmentation algorithms

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199901)33:1<43::AID-NET3>3.0.CO;2-6" /><43::AID-NET3>3.0.CO;2-6 10.1002/(SICI)1097-0037(199901)33:1<43::AID-NET3>3.0.CO;2-6zbMath0999.90007OpenAlexW2005215971MaRDI QIDQ4540088

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<43::aid-net3>3.0.co;2-6

zbMATH Keywords

network flowsstrongly polynomial algorithmmatching problemsaugmenting pathsbalanced flow networks

Mathematics Subject Classification ID

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

Related Items (3)

Graph factors and factorization: 1985--2003: a survey ⋮ Balanced network flows. IV. Duality and structure theory ⋮ Balanced network flows. VI. Polyhedral descriptions

Cites Work

• Unnamed Item
• Balanced network flows. IV. Duality and structure theory
• Paths, Trees, and Flowers

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