Geodesic
New algorithms for optimal resourse allocation
Prikladnaâ diskretnaâ matematika, no. 4 (2010), pp. 73-78.

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

New algorithms for the optimal allocation of resources are suggested using Pareto sets and branch-and-bound method.
Keywords: optimal allocation of resources, Pareto set, branch-and-bound method. 
@article{PDM_2010_4_a7,
     author = {V. I. Struchenkov},
     title = {New algorithms for optimal resourse allocation},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {73--78},
     publisher = {mathdoc},
     number = {4},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_4_a7/}
}
TY  - JOUR
AU  - V. I. Struchenkov
TI  - New algorithms for optimal resourse allocation
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 73
EP  - 78
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_4_a7/
LA  - ru
ID  - PDM_2010_4_a7
ER  - 
%0 Journal Article
%A V. I. Struchenkov
%T New algorithms for optimal resourse allocation
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 73-78
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_4_a7/
%G ru
%F PDM_2010_4_a7
V. I. Struchenkov. New algorithms for optimal resourse allocation. Prikladnaâ diskretnaâ matematika, no. 4 (2010), pp. 73-78. http://geodesic.mathdoc.fr/item/PDM_2010_4_a7/

[1] Bellman R., Dreifus S., Prikladnye zadachi dinamicheskogo programmirovaniya, Nauka, M., 1965, 458 pp. | Zbl

[2] Struchenkov V. I., “Dinamicheskoe programmirovanie s ispolzovaniem mnozhestv Pareto”, Diskret. analiz i issled. oper., 15:6 (2008), 58–62 | MR

[3] Mikhalevich V. S., “Posledovatelnye algoritmy optimizatsii i ikh primenenie”, Kibernetika, 1965, no. 1, 45–46

[4] Kuzyurin N. N., Fomin S. A., Effektivnye algoritmy i slozhnost vychislenii, MFTI, M., 2007, 210 pp.

[5] Struchenkov V. I., Metody optimizatsii v prikladnykh zadachakh, Solon-Press, M., 2009, 310 pp.