Geodesic
Properties of the solutions to the task of routing in the network with virtual circuits
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 7, pp. 785-793 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1997_37_7_a1,
     author = {N. S. Vasil'ev},
     title = {Properties of the solutions to the task of routing in the network with virtual circuits},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {785--793},
     year = {1997},
     volume = {37},
     number = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_7_a1/}
}
TY  - JOUR
AU  - N. S. Vasil'ev
TI  - Properties of the solutions to the task of routing in the network with virtual circuits
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1997
SP  - 785
EP  - 793
VL  - 37
IS  - 7
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_7_a1/
LA  - ru
ID  - ZVMMF_1997_37_7_a1
ER  - 
%0 Journal Article
%A N. S. Vasil'ev
%T Properties of the solutions to the task of routing in the network with virtual circuits
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1997
%P 785-793
%V 37
%N 7
%U http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_7_a1/
%G ru
%F ZVMMF_1997_37_7_a1
N. S. Vasil'ev. Properties of the solutions to the task of routing in the network with virtual circuits. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 7, pp. 785-793. http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_7_a1/

[1] Martin Dzh., Vychislitelnye seti i raspredelennaya obrabotka dannykh, Vyp. 1, 2, Finansy i statistika, M., 1985

[2] Bertsekas D., Gallager R., Seti peredachi dannykh, Mir, M., 1989

[3] Vasilev N. S., “Ravnovesnaya marshrutizatsiya koltsevykh setei”, Zh. vychisl. matem. i matem. fiz., 35:3 (1995), 452–459 | MR

[4] Vasilev N. S., Fedorov V. V., “O ravnovesnoi marshrutizatsii v setyakh peredachi dannykh”, Vestn. MGU. Ser. 15. Vychisl. matem. i kibernetika, 1996, no. 4, 47–52

[5] Vorobev N. N., Beskoalitsionnye igry, Nauka, M., 1984 | MR

[6] Vasilev N. S., “O nedopolnitelnosti ravnovesnoi marshrutizatsii koltsevykh setei”, Zh. vychisl. matem. i matem. fiz., 35:5 (1995), 794–801 | MR

[7] Vasilev N. S., “Suschestvovanie ravnovesnoi marshrutizatsii v nekoltsevykh setyakh peredachi dannykh”, Teoriya i sistemy upravleniya, 1996, no. 2, 163–167

[8] Kharari F., Teoriya grafov, Mir, M., 1973 | MR

[9] Ioffe A. D., Tikhomirov V. V., Teoriya ekstremalnykh zadach, Nauka, M., 1974 | MR | Zbl

[10] Fedorov V. V., Vvedenie v minimaks, Nauka, M., 1979

[11] Kantorovich A. V., Akilov G. P., Funktsionalnyi analiz, Nauka, M., 1977 | MR | Zbl

[12] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR

[13] Rosen I. B., “Existence and uniqueness of equilibrium point for concave $N$-person games”, Econometrica, 33:3 (1965), 520–534 | DOI | MR | Zbl

[14] Antipin A. S., “O skhodimosti i otsenkakh skorosti skhodimosti proksimalnykh metodov k nepodvizhnym tochkam ekstremalnykh otobrazheniya”, Zh. vychisl. matem. i matem. fiz., 35:5 (1995), 688–704 | MR | Zbl