Sur un modèle de développement d'un réseau de communicationsVASIL'EV, N. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 6, pp 15-21, issn 0002-3388Article

Three commodity flows in graphsOKAMURA, H; IYANAGA, S.Proceedings of the Japan Academy. Series A Mathematical sciences. 1983, Vol 59, Num 6, pp 266-269, issn 0386-2194Article

Maximal dynamic polymatroid flows and applicationsHAMACHER, H. W.Discrete applied mathematics. 1986, Vol 15, Num 1, pp 41-54, issn 0166-218XArticle

Un problème de flot avec des contraintes sur le nombre de transitsKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 2, pp 77-83, issn 0002-3388Article

On multicommodity flows in planar graphsHASSIN, R.Networks (New York, NY). 1984, Vol 14, Num 2, pp 225-235, issn 0028-3045Article

A strongly polynomial minimum cost circulation algorithmTARDOS, E.Combinatorica (Print). 1986, Vol 5, Num 3, pp 147-255, issn 0209-9683Article

Tutte's 5-flow conjecture for the projective planeSTEINBERG, R.Journal of graph theory. 1984, Vol 8, Num 2, pp 277-285, issn 0364-9024Article

Preemptive scheduling linear programming and network flowsDE WERRA, D.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 1, pp 11-20, issn 0196-5212Article

Polymatroidal flows with lower boundsLAWLER, E. L; MARTEL, C. U.Discrete applied mathematics. 1986, Vol 15, Num 2-3, pp 291-313, issn 0166-218XArticle

Nowhere-zero integral flows on a bidirected graphBOUCHET, A.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 279-292, issn 0095-8956Article

Flow graphs and decision algorithmsPAWLAK, Zdzisław.Lecture notes in computer science. 2003, pp 1-10, issn 0302-9743, isbn 3-540-14040-9, 10 p.Conference Paper

A unified framework for primal-dual methods in minimum cost network flow problemsBERTSEKAS, D. P.Mathematical programming. 1985, Vol 32, Num 2, pp 125-145, issn 0025-5610Article

Problème de flot maximal dans les réseaux avec retransmissionKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 133-135, issn 0002-3388Article

Integer flowsYOUNGER, D. H.Journal of graph theory. 1983, Vol 7, Num 3, pp 349-357, issn 0364-9024Article

Etude numérique de la convergence des flots redondants réunis vers un flot de PoissonVRAZHNOV, V. N; DUBROVINSKIJ, V. M; SHNEPS, M. A et al.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1983, Num 6, pp 129-135, issn 0002-3388Article

Nowhere-zero flows in low genus graphsMOLLER, M; CARSTENS, H. G; BRINKMANN, G et al.Journal of graph theory. 1988, Vol 12, Num 2, pp 183-190, issn 0364-9024Article

An efficient algorithm for the transshipment along a single road problemAGHA IQBAL ALI.Naval research logistics quarterly. 1986, Vol 33, Num 4, pp 673-684, issn 0028-1441Article

On node constraint networksGROFLIN, H.Networks (New York, NY). 1985, Vol 15, Num 4, pp 469-475, issn 0028-3045Article

Flows in circulant graphs of odd order are sums of Hamilton cyclesLOCKE, S. C; WITTE, D.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 105-114, issn 0012-365X, 10 p.Article

Sur la répartition optimale des extrapolateurs pour la prévision des flots aléatoiresALIDINA, i. v; VAJNSHTEJN, A. D; EFIMOV, A. N et al.Avtomatika i telemehanika. 1984, Num 4, pp 122-127, issn 0005-2310Article

A network-flow algorithm for project selectionBAKER, B. M.The Journal of the Operational Research Society. 1984, Vol 35, Num 9, pp 847-852, issn 0160-5682Article

Solving generalized networksBROWN, G. G; MCBRIDE, R. D.Management science. 1984, Vol 30, Num 12, pp 1497-1523, issn 0025-1909Article

Reliability evaluation of flow networks using delta-star transformationsSINGH, C; ASGARPOOR, S.IEEE transactions on reliability. 1986, Vol 35, Num 4, pp 472-477, issn 0018-9529Article

Metrics and undirected cutsKARZANOV, A. V.Mathematical programming. 1985, Vol 32, Num 2, pp 183-198, issn 0025-5610Article

Duality for balanced submodular flowsZIMMERMAN, U.Discrete applied mathematics. 1986, Vol 15, Num 2-3, pp 365-376, issn 0166-218XArticle