Convex polyhedra in network optimization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 42 (2002) no. 5, pp. 729-740 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2002_42_5_a11,
     author = {A. A. Mironov},
     title = {Convex polyhedra in network optimization problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {729--740},
     year = {2002},
     volume = {42},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_5_a11/}
}
TY  - JOUR
AU  - A. A. Mironov
TI  - Convex polyhedra in network optimization problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2002
SP  - 729
EP  - 740
VL  - 42
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_5_a11/
LA  - ru
ID  - ZVMMF_2002_42_5_a11
ER  - 
%0 Journal Article
%A A. A. Mironov
%T Convex polyhedra in network optimization problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2002
%P 729-740
%V 42
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_5_a11/
%G ru
%F ZVMMF_2002_42_5_a11
A. A. Mironov. Convex polyhedra in network optimization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 42 (2002) no. 5, pp. 729-740. http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_5_a11/

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

[2] 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

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

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

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

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

[7] Mironov A. A., Tsurkov V. I., “Transportnye i setevye zadachi s minimaksnym kriteriem”, Zh. vychisl. matem. i matem. fiz., 35:1 (1995), 24–45 | MR | Zbl

[8] Mironov A. A., “Ravnomernye obobschennye grafy”, Dokl. RAN, 351:4 (1996), 465–468 | MR | Zbl

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

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

[11] Danford N., Shvarts Dzh. T., Lineinye operatory (obschaya teoriya), Mir, M., 1962

[12] Glazman I. M., Lyubich Yu. I., Konechnomernyi lineinyi analiz, Nauka, M., 1969 | MR | Zbl

[13] Mironov A. A., Tsurkov V. I., Minimaks v transportnykh zadachakh, Nauka, M., 1997

[14] Tsurkov V., Mironov A., Minimax under transportation constrains, Kluwer Acad. Publ., Dordrecht–Boston–London, 1999 | MR | Zbl

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

[16] Kuznetsov A. V., Sakovich V. A., Kholod N. N., Vysshaya matematika. Matematicheskoe programmirovanie, Vyssh. shkola, Minsk, 1994 | Zbl