Balanced network flows. IV. Duality and structure theory

DOI10.1002/net.1013zbMath1038.90007OpenAlexW1970533659MaRDI QIDQ2744653

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 31 July 2002

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

dualitynetwork flowsbarrierscutsodd setsfactor theoremscapacitated matching problemsGallai - Edmonds decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Graph factors and factorization: 1985--2003: a survey, Balanced network flows. VI. Polyhedral descriptions, Unnamed Item, Unnamed Item, Balanced network flows. III. Strongly polynomial augmentation algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• Antisymmetrical Digraphs
• Subgraphs with prescribed valencies
• The Factors of Graphs