Geodesic
Solution of stochastic problems of assessing the feasibility of multicommodity flows
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 5, pp. 749-769 
N. M. Novikova. Solution of stochastic problems of assessing the feasibility of multicommodity flows. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 5, pp. 749-769. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_5_a7/
@article{ZVMMF_1998_38_5_a7,
     author = {N. M. Novikova},
     title = {Solution of stochastic problems of assessing the feasibility of multicommodity flows},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {749--769},
     year = {1998},
     volume = {38},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_5_a7/}
}
TY  - JOUR
AU  - N. M. Novikova
TI  - Solution of stochastic problems of assessing the feasibility of multicommodity flows
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 749
EP  - 769
VL  - 38
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_5_a7/
LA  - ru
ID  - ZVMMF_1998_38_5_a7
ER  - 
%0 Journal Article
%A N. M. Novikova
%T Solution of stochastic problems of assessing the feasibility of multicommodity flows
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 749-769
%V 38
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_5_a7/
%G ru
%F ZVMMF_1998_38_5_a7

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

[1] Germeier Yu. B., Vvedenie v teoriyu issledovaniya operatsii, Nauka, M., 1971

[2] Ermolev Yu. M., Stokhasticheskoe programmirovanie, Nauka, M., 1976

[3] Malashenko Yu. E., “Normativnyi podkhod k analizu mnogoproduktovykh setei”, Izv. AN SSSR. Tekhn. kibernetika, 1988, no. 3, 117–122 | MR

[4] Malashenko Yu. E., Novikova N. M., “Obobschennaya zadacha analiza mnogoproduktovoi seti”, Izv. AN SSSR. Tekhn. kibernetika, 1989, no. 4, 137–152 | MR

[5] Minu M., Matematicheskoe programmirovanie, Nauka, M., 1990

[6] Morozov V. V., Sukharev A. G., Fedorov V. V., Issledovanie operatsii v zadachakh i uprazhneniyakh, Vyssh. shkola, M., 1986

[7] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982

[8] Smirnov M. M., “Metody approksimatsii granei mnozhestva Pareto v lineinoi mnogokriterialnoi zadache”, Vestn. MGU. Vychisl. matem. i kibernetika, 1996, no. 3, 37–43

[9] Leighton T., Makedon F., Plotkin S. et al., “Fast approximation algorithms for multicommodity flow problems”, Proc. 23rd Ann. ACM Symp. on Theory of Computing, 1991, 101–111

[10] Leong T., Shor P., Stein C., Implementation of a combinatorial multicommodity flow algorithm, DIMACS Working paper, 1992

[11] Matula D. W., “Concurrent flow and concurrent connectivity in graphs”, Graph Theory and Its Appl. Algorithms and Comput. Sci., Wiley Intersci. Publ., New York, 1985, 543–559 | MR

[12] Novikova N. M., “Iterative stochastic methods for solving variational problems of mathematical physics and operations research”, J. Math. Sci., 68:1 (1994), 1–124 ; Contemprorary Math. and Its Applic., 3, Plenum Publ. Corp., New York–London | DOI | MR | Zbl

[13] Thompson B. J., Matula D. W., A flow rerouting algorithm for maximum concurrent flow problem with variable capacities and demands, and its application to cluster analysis, Techn. Rept 86-CSE-12, Comput. Sci. Dept., Southern Methodist Univ., March, 1986