Geodesic
The optimum flow network synthesis problem on a graph
News of the Kabardin-Balkar scientific center of RAS, no. 6-1 (2017), pp. 42-48

Voir la notice de l'article provenant de la source Math-Net.Ru

One of the important and unsolved problem is the problem of designing a basic flow network graph with connection between nodes with the subsequent design of the optimum flow network. This paper presents a design method for the basic (excess) flow network graph with connection between nodes. The method is based on the formalization of the engineering approach and optimization.
Keywords: base graph, flow network, design method, arc efficiency function, algorithm.
Mots-clés : model situations 
@article{IZKAB_2017_6-1_a6,
     author = {V. Ch. Kudaev and L. V. Skorikova},
     title = {The optimum flow network synthesis problem on a graph},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {42--48},
     publisher = {mathdoc},
     number = {6-1},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2017_6-1_a6/}
}
TY  - JOUR
AU  - V. Ch. Kudaev
AU  - L. V. Skorikova
TI  - The optimum flow network synthesis problem on a graph
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2017
SP  - 42
EP  - 48
IS  - 6-1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2017_6-1_a6/
LA  - ru
ID  - IZKAB_2017_6-1_a6
ER  - 
%0 Journal Article
%A V. Ch. Kudaev
%A L. V. Skorikova
%T The optimum flow network synthesis problem on a graph
%J News of the Kabardin-Balkar scientific center of RAS
%D 2017
%P 42-48
%N 6-1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IZKAB_2017_6-1_a6/
%G ru
%F IZKAB_2017_6-1_a6
V. Ch. Kudaev; L. V. Skorikova. The optimum flow network synthesis problem on a graph. News of the Kabardin-Balkar scientific center of RAS, no. 6-1 (2017), pp. 42-48. http://geodesic.mathdoc.fr/item/IZKAB_2017_6-1_a6/