Balanced network flows. VII. Primal-dual algorithms

DOI10.1002/net.10002zbMath1040.90003OpenAlexW2153771772MaRDI QIDQ2782730

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 8 April 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10002

zbMATH Keywords

network flowsprimal-dual algorithmshortest path problemscapacitated matching problems\(b\)-matching problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Path problems in skew-symmetric graphs
• Balanced network flows. V. Cycle-canceling algorithms
• Balanced network flows. VI. Polyhedral descriptions
• An analysis of alternative strategies for implementing matching algorithms
• Maximum matching and a polyhedron with 0,1-vertices