Geodesic
Algorithm for optimal distribution of discrete nonuniform resources on a network
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 1, pp. 54-60
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1997_37_1_a6,
     author = {V. G. Anisimov and E. G. Anisimov},
     title = {Algorithm for optimal distribution of discrete nonuniform resources on a network},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {54--60},
     year = {1997},
     volume = {37},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_1_a6/}
}
TY  - JOUR
AU  - V. G. Anisimov
AU  - E. G. Anisimov
TI  - Algorithm for optimal distribution of discrete nonuniform resources on a network
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1997
SP  - 54
EP  - 60
VL  - 37
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_1_a6/
LA  - ru
ID  - ZVMMF_1997_37_1_a6
ER  - 
%0 Journal Article
%A V. G. Anisimov
%A E. G. Anisimov
%T Algorithm for optimal distribution of discrete nonuniform resources on a network
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1997
%P 54-60
%V 37
%N 1
%U http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_1_a6/
%G ru
%F ZVMMF_1997_37_1_a6
V. G. Anisimov; E. G. Anisimov. Algorithm for optimal distribution of discrete nonuniform resources on a network. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 1, pp. 54-60. http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_1_a6/

[1] Salvador M., “Kalendarnoe planirovanie i uporyadochenie rabot”, Issl. operatsii, v. 2, Mir, M., 1981, 232–263

[2] Gern M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[3] E. G. Kofman (red.), Teoriya raspisanii i vychislitelnye mashiny, Nauka, M., 1984 | MR

[4] Zukhovitskii S. I., Radchik I. A., Matematicheskie metody setevogo planirovaniya, Nauka, M., 1965 | MR

[5] Podchasova T. P., Portugal V. M., Tatarov V. A., Shkurba V. V., Evristicheskie metody kalendarnogo planirovaniya, Tekhnika, Kiev, 1984

[6] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Priblizhennye algoritmy”, Avtomatika i telemekhan., 1989, no. 11, 3–24 | MR

[7] Bellman R., Dynamic programming, Princeton Univ. Press, Princeton, 1957 | MR

[8] Konvei R. V., Maksvell V. L., Miller L. V., Teoriya raspisanii, Nauka, M., 1975 | MR

[9] Tanaev B. C., Shkurba V. V., Vvedenie v teoriyu raspisanii, Nauka, M., 1975 | MR | Zbl

[10] Setevye metody upravleniya v proektirovanii i proizvodstve, Mir, M., 1979

[11] Babaev A. A., “Optimizatsiya posledovatelnosti kontrolya mashin pri puske proizvodstvennogo ob'ekta”, Nadezhnost i kontrol kachestva, 1982, no. 5, 12–29 | MR

[12] Golovkin B. A., Raschet kharakteristik i planirovanie parallelnykh vychislitelnykh protsessov, Radio i svyaz, M., 1983

[13] Mikhalevich V. S., Kuksa A. I., Metody posledovatelnoi optimizatsii v diskretnykh setevykh zadachakh optimalnogo raspredeleniya resursov, Nauka, M., 1983 | MR | Zbl

[14] Shafranskii V. V., Matematicheskie modeli i metody planirovaniya razvitiya otraslei promyshlennosti, Nauka, M., 1984 | MR

[15] Aleksandrov N. I., Komkov N. I., Modelirovanie organizatsii i upravleniya resheniem nauchno-tekhnicheskikh problem, Nauka, M., 1988

[16] Alekseev A. O., “Minimalnaya zadacha $M$ kommivoyazherov”, Zh. vychisl. matem. i matem. fiz., 31:12 (1991), 1899–1905 | MR | Zbl

[17] Kuznetsov V. F., “Raspredelenie resursov s uchetom vozmozhnosti ikh peremescheniya pri zadannoi topologii seti”, Avtomatika i telemekhan., 1975, no. 5, 97–105 | MR | Zbl

[18] Alekseev O. G., Kompleksnoe primenenie metodov optimizatsii, Nauka, M., 1987 | MR

[19] Anisimov V. G., Anisimov E. G., “Algoritm vetvei i granits dlya odnogo klassa zadach teooii raspisanii”, Zh. vychisl. matem. i matem. fiz., 32:12 (1992), 2000–2005 | MR | Zbl

[20] Little J. D., Murty K. G., Sveeney D. W., Karel C., “An algorithm for the traveling salesman problem”, Operat. Res., 11:6 (1963), 972–989 | DOI | Zbl