Geodesic
Transport and network problems with the minimax criterion
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 1, pp. 24-45 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1995_35_1_a2,
     author = {A. A. Mironov and V. I. Tsurkov},
     title = {Transport and network problems with the minimax criterion},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {24--45},
     year = {1995},
     volume = {35},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_1_a2/}
}
TY  - JOUR
AU  - A. A. Mironov
AU  - V. I. Tsurkov
TI  - Transport and network problems with the minimax criterion
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1995
SP  - 24
EP  - 45
VL  - 35
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_1_a2/
LA  - ru
ID  - ZVMMF_1995_35_1_a2
ER  - 
%0 Journal Article
%A A. A. Mironov
%A V. I. Tsurkov
%T Transport and network problems with the minimax criterion
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1995
%P 24-45
%V 35
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_1_a2/
%G ru
%F ZVMMF_1995_35_1_a2
A. A. Mironov; V. I. Tsurkov. Transport and network problems with the minimax criterion. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 1, pp. 24-45. http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_1_a2/

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

[2] Kristofides N., Teoriya grafov, Mir, M., 1978 | MR

[3] Zykov A. A., Teoriya konechnykh grafov, Nauka, Novosibirsk, 1969

[4] Moiseev N. N., Elementy teorii optimalnykh sistem, Nauka, M., 1975 | MR

[5] Tsurkov V. I., Dekompozitsiya v zadachakh bolshoi razmernosti, Nauka, M., 1981 | MR

[6] Mironov A. A., “O svoistvakh naborov stepenei vershin obobschennykh grafov”, Dokl. AN SSSR, 324:5 (1992), 959–963 | MR | Zbl

[7] Mironov A. A., Tsurkov V. I., “Setevye modeli s fiksirovannymi parametrami na uzlakh svyazi. 1”, Izv. RAN. Tekhn. kibernetika, 1993, no. 4, 212–223 | MR | Zbl

[8] Mironov A. A., “Geometriya tochek prostranstva $\mathbb R^n$, realizuemykh v graf”, Uspekhi matem. nauk, 32:6 (1977), 231–232 | MR | Zbl

[9] Mironov A. A., “O realizuemosti naborov chisel v graf i svoistva grafov s zadannym naborom stepenei”, Kombinatorno-algebraich. metody v prikl. matem., Gorkovskii GU, Gorkii, 1981, 76–97 | MR | Zbl

[10] Mironov A. A., “O veroyatnostnykh svoistvakh sluchainogo grafa s zadannym naborom stepenei vershin”, Izv. AN SSSR. Tekhn. kibernetika, 1990, no. 4, 180–188 | MR | Zbl

[11] Mironov A. A., Tsurkov V. I., “Graficheskoe predstavlenie mnogourovnevykh ierarkhicheskikh struktur”, Izv. AN SSSR. Tekhn. kibernetika, 1991, no. 3, 148–155 | MR | Zbl

[12] Mironov A. A., Tsurkov V. I., “Approksimatsiya i dekompozitsiya ekstremalnymi grafami”, Zh. vychisl. matem. i matem. fiz., 33:2 (1993), 283–298 | MR | Zbl

[13] Mironov A. A., “Nekotorye svoistva naborov chisel, realizuemykh v graf”, Tr. MIITa, 640, M., 1979, 115–120 | MR

[14] Khakimi S. L., “O realizuemosti mnozhestva tselykh neotritsatelnykh chisel stepenyami vershin grafa”, Kibernetich. sb. Nov. ser., 2, Mir, M., 1966, 496–506

[15] Mironov A. A., “Obobschennye grafy s ogranicheniyami dlya stepenei vershin”, Dokl. RAN, 333:4 (1993), 437–439 | MR | Zbl

[16] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986 | MR | Zbl