Ivanescu, Peter L. Some network flow problems solved with pseudo-Boolean programming. (English) Zbl 0132.13804 Oper. Res. 13, 388-399 (1965). Summary: The aim of this paper is to apply the method of pseudo-Boolean programming to the determination of the minimal cut and of the value of the maximal flow through a network without, or with, given lower bounds on the arc flows, as well as to the solution of some feasibility problems in networks. Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 49 Documents MSC: 90C09 Boolean programming 90B10 Deterministic network models in operations research Keywords:operations research PDF BibTeX XML Cite \textit{P. L. Ivanescu}, Oper. Res. 13, 388--399 (1965; Zbl 0132.13804) Full Text: DOI Link