Abstract.
In this paper we give a flow model on directed multigraphs by introducing reflexions of generalized polymatroids at vertices as constraints for the flow conservation. This model has the essential features of the classical flow model, primarily the max-flow min-cut theorem and the polynomial algorithm for computing the maximal feasible (integral) flow.
AMS subject classification.
Keywords.
Quasi polynomial flow network, generalized polymatroid, quasi polymatroid, integral flow
Download: Adobe PDF Compressed Postscript
Compressed Postscript 
