Fremuth-Paeger, Christian; Jungnickel, Dieter An introduction to balanced network flows. (English) Zbl 1009.05113 Arasu, K. T. (ed.) et al., Codes and designs. Proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, Columbus, OH, USA, May 18-21, 2000. Berlin: de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 10, 125-144 (2002). The authors present an introduction to the treatment of general matching problems (both in the weighted and the cardinality case) based on a network flow approach. The paper only contains a framework, but no proofs and no algorithmic details. These can be found in a series of eight articles by the same authors in the journal Networks.For the entire collection see [Zbl 0996.00030]. Reviewer: Lutz Volkmann (Aachen) MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 90B10 Deterministic network models in operations research 90C35 Programming involving graphs or networks Keywords:matching; network flow PDFBibTeX XMLCite \textit{C. Fremuth-Paeger} and \textit{D. Jungnickel}, Ohio State Univ. Math. Res. Inst. Publ. 10, 125--144 (2002; Zbl 1009.05113)