Geodesic
A method for solving a discrete optimization problem with polynomially tabular functions
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 3, pp. 501-507 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2001_41_3_a14,
     author = {A. I. Diveev},
     title = {A method for solving a discrete optimization problem with polynomially tabular functions},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {501--507},
     year = {2001},
     volume = {41},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_3_a14/}
}
TY  - JOUR
AU  - A. I. Diveev
TI  - A method for solving a discrete optimization problem with polynomially tabular functions
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2001
SP  - 501
EP  - 507
VL  - 41
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_3_a14/
LA  - ru
ID  - ZVMMF_2001_41_3_a14
ER  - 
%0 Journal Article
%A A. I. Diveev
%T A method for solving a discrete optimization problem with polynomially tabular functions
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2001
%P 501-507
%V 41
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_3_a14/
%G ru
%F ZVMMF_2001_41_3_a14
A. I. Diveev. A method for solving a discrete optimization problem with polynomially tabular functions. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 3, pp. 501-507. http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_3_a14/

[1] Lawler E. L., Bell M. D., “A method for solving discrete optimization problems”, Operat. Res., 14:6 (1966), 1098–1112 | DOI | MR

[2] Mao J. C. T., Wallingford B. A., “An extension of lawler and Bell's method of discrete optimization with examples from capital budgeting”, Management Sci., 15:2 (1968), 51–60 | DOI

[3] Diveev A. I., “Metod bimonotonnogo razlozheniya v zadache vybora optimalnogo varianta”, Vopr. teorii bezopasnosti i ustoichivosti sistem, VTs RAN, M., 1998, 94–105

[4] Diveev A. I., “Algoritm poiska optimalnoi struktury seti konveierov”, Vestn. RUDN. Ser. kibernetika, 1998, no. 1, 3–8

[5] Diveev A. I., Severtsev N. A., “Optimalnyi vybor varianta izdeliya po parametram stoimosti i nadezhnosti”, Probl. mashinostr. i nadezhnosti mashin, 2, Izd-vo RAN, M., 1999, 3–7

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

[7] Kofman A., Anri-Laborder A., Metody i modeli issledovaniya operatsii. Tselochislennoe programmirovanie, Mir, M., 1977 | MR