Geodesic
Asymptotic approach to solving the multi-index axial transportation problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 7, pp. 1133-1139 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_7_a8,
     author = {M. K. Kravtsov and A. P. Krachkovskii},
     title = {Asymptotic approach to solving the multi-index axial transportation problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1133--1139},
     year = {1998},
     volume = {38},
     number = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_7_a8/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - A. P. Krachkovskii
TI  - Asymptotic approach to solving the multi-index axial transportation problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 1133
EP  - 1139
VL  - 38
IS  - 7
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_7_a8/
LA  - ru
ID  - ZVMMF_1998_38_7_a8
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A A. P. Krachkovskii
%T Asymptotic approach to solving the multi-index axial transportation problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 1133-1139
%V 38
%N 7
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_7_a8/
%G ru
%F ZVMMF_1998_38_7_a8
M. K. Kravtsov; A. P. Krachkovskii. Asymptotic approach to solving the multi-index axial transportation problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 7, pp. 1133-1139. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_7_a8/

[1] Ahuja R. K., Magnanti T. L., Orlin J. B., Network flows, North Holland: Elsevier Sci. Publs, B.V., 1992

[2] Golshtein E. G., Yudin D. B., Zadachi lineinogo programmirovaniya transportnogo tipa, Nauka, M., 1969

[3] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981

[4] Emelichev V. A., Kravtsov M. K., “Poliedralnye aspekty mnogoindeksnykh aksialnykh transportnykh zadach”, Diskretnaya matem., 3:2 (1991), 3–24

[5] Emelichev V. A., Kravtsov M. K., Krachkovskii A. P., “Mnogoindeksnye planarnye transportnye mnogogranniki s maksimalnym chislom vershin”, Diskretnaya matem., 4:1 (1992), 3–18

[6] Even S., Itai A., Shamir A., “On the complexity of timetable and multicommodity flow problems”, SIAM J. Comput., 5:4 (1976), 691–703 | DOI | MR | Zbl

[7] Raskin L. G., Kirichenko I. O., Mnogoindeksnye zadachi lineinogo programmirovaniya, Radio i svyaz, M., 1982 | Zbl

[8] Perepelitsa V. A., “O dvukh zadachakh iz teorii grafov”, Dokl. AN SSSR, 194:6 (1970), 1269–1272

[9] Korshunov A. D., “Osnovnye svoistva sluchainykh grafov s bolshim chislom vershin i reber”, Uspekhi matem. nauk, 40:1 (1985), 107–173 | MR | Zbl

[10] Emelichev V. A., Perepelitsa V. A., “Slozhnost diskretnykh mnogokriterialnykh zadach”, Diskretnaya matem., 6:1 (1994), 3–33 | Zbl

[11] Emelichev V. A., Efimchik N. E., “Asimptoticheskii podkhod k zadache o $k$-mediane grafa”, Kibernetika i sistemnyi analiz, 1994, no. 5, 109–117 | MR | Zbl

[12] Sergienko I. V., Perepelitsa V. A., “K probleme nakhozhdeniya mnozhestv alternativ v diskretnykh mnogokriterialnykh zadachakh”, Kibernetika, 1987, no. 5, 85–93 | MR | Zbl

[13] Emelichev V. A., Perepelitsa V. A., Shungerov Kh. D., “Asimptoticheskii podkhod k mnogokriterialnoi zadache pokrytiya grafa zvezdami”, Dokl. AN BSSR, 31:5 (1985), 5–9

[14] Smale S., “On the average number of steps in the simplex method of linear programming”, Math. Program., 27:1 (1983), 241–262 | DOI | MR | Zbl

[15] Kuzyurin N. N., “Polinomialnyi v srednem algoritm v tselochislennom lineinom programmirovanii”, Issl. operatsii, 1:3 (1994), 38–48 | MR | Zbl

[16] Feller V., Vvedenie v teoriyu veroyatnostei i ee prilozheniya, v. 1, Mir, M., 1967

[17] Mouldon J. G., “Random division of an interval”, Proc. Cambridge Philos. Soc., 47:2 (1951), 331–336 | DOI | MR

[18] Knut D., Iskusstvo programmirovaniya dlya EVM, v. 1, Mir, M., 1976