Some Network Flow Problems Solved with Pseudo-Boolean Programming

Peter L. Ivănescu
Additional contact information
Peter L. Ivănescu: Institute of Mathematics, Romanian Academy, Bucharest, Romania

Operations Research, 1965, vol. 13, issue 3, 388-399

Abstract: 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.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.3.388 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:3:p:388-399

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().