Geodesic
Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 2, pp. 342-345 
M. K. Kravtsov; A. P. Krachkovskii. Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 2, pp. 342-345. http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_2_a13/
@article{ZVMMF_2001_41_2_a13,
     author = {M. K. Kravtsov and A. P. Krachkovskii},
     title = {Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {342--345},
     year = {2001},
     volume = {41},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_2_a13/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - A. P. Krachkovskii
TI  - Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2001
SP  - 342
EP  - 345
VL  - 41
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_2_a13/
LA  - ru
ID  - ZVMMF_2001_41_2_a13
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A A. P. Krachkovskii
%T Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2001
%P 342-345
%V 41
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_2_a13/
%G ru
%F ZVMMF_2001_41_2_a13

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

[1] Kravtsov M. K., Krachkovskii A. P., “Polinomialnyi algoritm dlya mnogoindeksnoi problemy vybora”, Zh. vychisl. matem. i matem. fiz., 39:6 (1999), 1041–1044 | MR | Zbl

[2] Kravtsov M. K., Krachkovskii A. P., “Zamechaniya k state: Polinomialnyi algoritm dlya mnogoindeksnoi problemy vybora”, Zh. vychisl. matem. i matem. fiz., 40:9 (2000), 1440 | MR | Zbl

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

[4] Dinits E. A., Kronrod M. A., “Odin algoritm resheniya zadachi o naznacheniyakh”, Dokl. AN SSSR, 189:1 (1969), 23–25

[5] Svami M., Tkhulasiraman K., Grafy, seti i algoritmy, Mir, M., 1984

[6] Perepelitsa V. A., Mnogokriterialnye zadachi teorii grafov. Algoritmicheskii podkhod, Kiev, 1989

[7] Kravtsov M. K., Krachkovskii A. P., “Asimptoticheskii podkhod k resheniyu mnogoindeksnoi aksialnoi transportnoi zadachi”, Zh. vychisl. matem. i matem. fiz., 38:7 (1998), 1133–1139 | MR | Zbl