zbMATH — the first resource for mathematics

Some network flow problems solved with pseudo-Boolean programming. (English) Zbl 0132.13804
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.

90C09 Boolean programming
90B10 Deterministic network models in operations research
PDF BibTeX Cite
Full Text: DOI Link