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.
No takes yet. Share an insight, caveat, or question.
P. L. Ivanescu (1965) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: