Geodesic
QUASI POLYMATROIDAL FLOW NETWORKS
Acta mathematica Universitatis Comenianae, Tome 64 (1995) no. 1 
M. Kochol. QUASI POLYMATROIDAL FLOW NETWORKS. Acta mathematica Universitatis Comenianae, Tome 64 (1995) no. 1. http://geodesic.mathdoc.fr/item/AMUC_1995_64_1_a6/
@article{AMUC_1995_64_1_a6,
     author = {M. Kochol},
     title = {QUASI {POLYMATROIDAL} {FLOW} {NETWORKS}},
     journal = {Acta mathematica Universitatis Comenianae},
     year = {1995},
     volume = {64},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/AMUC_1995_64_1_a6/}
}
TY  - JOUR
AU  - M. Kochol
TI  - QUASI POLYMATROIDAL FLOW NETWORKS
JO  - Acta mathematica Universitatis Comenianae
PY  - 1995
VL  - 64
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/AMUC_1995_64_1_a6/
ID  - AMUC_1995_64_1_a6
ER  - 
%0 Journal Article
%A M. Kochol
%T QUASI POLYMATROIDAL FLOW NETWORKS
%J Acta mathematica Universitatis Comenianae
%D 1995
%V 64
%N 1
%U http://geodesic.mathdoc.fr/item/AMUC_1995_64_1_a6/
%F AMUC_1995_64_1_a6

Voir la notice de l'article provenant de la source Comenius University

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.