Some Network Flow Problems Solved with Pseudo-Boolean Programming

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.

Saved in:
Bibliographic Details
Published in:Operations research 1965-05, Vol.13 (3), p.388-399
Main Author: Ivanescu, Peter L
Format: Article
Language:English
Subjects:
Mathematical functions
Mathematical minima
Mathematical theorems
Polynomials
Transportation
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.13.3.388