Frieze, A. M. Algebraic flows. (English) Zbl 0567.90027 Algebraic and combinatorial methods in operations research, Proc. Workshop, Ann. Discrete Math. 19, 135-146 (1984). Reviewer: T.Sawik MSC: 90B10 90C48 90C10 90B35 PDFBibTeX XML
Grötschel, Martin Polyedrische Kombinatorik und Schnittebenenverfahren. (German) Zbl 0563.90074 Ber. Math.-Stat. Sekt. Forschungszent. Graz 231, 32 p. (1984). MSC: 90C10 52Bxx 90-01 PDFBibTeX XML
Reichmeider, Philip F. The equivalence of some combinatorial matching theorems. (English) Zbl 0562.05020 Washington, New Jersey: Polygonal Publishing House. 123 p. (1984). Reviewer: J.Sedláček MSC: 05-02 05C99 PDFBibTeX XML
Schrijver, A. Total dual integrality from directed graphs, crossing families, and sub- and supermodular functions. (English) Zbl 0542.90068 Progress in combinatorial optimization, Conf. Waterloo/Ont. 1982, 315-361 (1984). MSC: 90C10 90B10 05C35 90C11 90C35 90-02 05B35 05C70 90C05 05C05 PDFBibTeX XML
Liu, Chenching; Wu, Felix F. A generalized network flow model with application to power supply-demand problems. (English) Zbl 0542.90035 Networks 14, 117-139 (1984). Reviewer: K.G.Murty MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{C. Liu} and \textit{F. F. Wu}, Networks 14, 117--139 (1984; Zbl 0542.90035) Full Text: DOI
Grötschel, Martin; Nemhauser, George L. A polynomial algorithm for the max-cut problem on graphs without long odd cycles. (English) Zbl 0532.90074 Math Program. 29, 28-40 (1984). MSC: 90C10 68Q25 05C35 90C35 PDFBibTeX XMLCite \textit{M. Grötschel} and \textit{G. L. Nemhauser}, Math. Program. 29, 28--40 (1984; Zbl 0532.90074) Full Text: DOI