Geodesic
A polynomial algorithm for the multi-index decision problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 6, pp. 1041-1044 
M. K. Kravtsov; A. P. Krachkovskii. A polynomial algorithm for the multi-index decision problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 6, pp. 1041-1044. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a13/
@article{ZVMMF_1999_39_6_a13,
     author = {M. K. Kravtsov and A. P. Krachkovskii},
     title = {A polynomial algorithm for the multi-index decision problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1041--1044},
     year = {1999},
     volume = {39},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a13/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - A. P. Krachkovskii
TI  - A polynomial algorithm for the multi-index decision problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 1041
EP  - 1044
VL  - 39
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a13/
LA  - ru
ID  - ZVMMF_1999_39_6_a13
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A A. P. Krachkovskii
%T A polynomial algorithm for the multi-index decision problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 1041-1044
%V 39
%N 6
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a13/
%G ru
%F ZVMMF_1999_39_6_a13

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

[1] Frieze A. M., “Complexity of a 3-dimensional assignment problem”, Europian. J. Operat. Res., 13 (1983), 161–164 | DOI | MR | Zbl

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

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

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

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

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

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

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

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

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

[11] Gimadi E. Kh., “Asimptoticheski tochnyi podkhod k resheniyu mnogoindeksnoi aksialnoi zadachi o naznachenii”, Tr. XI mezhdunar. Baikalskoi shkoly-seminara. Plenarnye dokl. (Irkutsk, 1998), 62–65

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

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

[14] Kravtsov M. K., Sherman A. Kh., Averbukh N. D., “Ob odnom algoritme resheniya zadachi o naznacheniyakh”, Izv. AN Belarusi. Ser. fiz.-matem. nauk, 1975, no. 6, 102–105 | Zbl

[15] Gol'shtein E. G., Yudin D. B., Zadachi lineinogo programmirovaniya transportnogo tipa, Nauka, M., 1969