Balanced network flows. VI: Polyhedral descriptions.

DOI10.1002/NET.1015MaRDI QIDQ2744655zbMATH OpenOpenAlexFDO

Authors 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

\(b\)-matching problemsblossom inequalitiescapacitated matching problemscomb inequalitiesnetwork flowsodd-set inequalities

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1769330
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• scientific article; zbMATH DE number 653269
• Maximum balanced flow in a network
• scientific article; zbMATH DE number 842873

Cites work

• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Balanced network flows. IV: Duality and structure theory.
• Balanced network flows. V: Cycle-canceling 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?)
• Path problems in skew-symmetric graphs
• Short proofs on the matching polyhedron

Cited in

(2)

• Balanced network flows. VII: Primal-dual algorithms.
• scientific article; zbMATH DE number 1867228 (Why is no real title available?)

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

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