Balanced network flows. VI. Polyhedral descriptions

DOI10.1002/net.1015zbMath1040.90002OpenAlexW1970359227MaRDI QIDQ2744655

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 31 July 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.2183

zbMATH Keywords

network flowscomb inequalitiesblossom inequalitiescapacitated matching problems\(b\)-matching problemsodd-set inequalities

Mathematics Subject Classification ID

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

Related Items (1)

Balanced network flows. VII. Primal-dual algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Short proofs on the matching polyhedron
• Path problems in skew-symmetric graphs
• Balanced network flows. IV. Duality and structure theory
• Balanced network flows. V. Cycle-canceling algorithms
• Balanced network flows. III. Strongly polynomial augmentation algorithms

This page was built for publication: Balanced network flows. VI. Polyhedral descriptions