Geodesic
The complexity of the computation of a global minimum in certain classes of optimization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 10, pp. 1480-1498

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

@article{ZVMMF_1993_33_10_a3,
     author = {V. N. Nef\"edov},
     title = {The complexity of the computation of a global minimum in certain classes of optimization problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1480--1498},
     publisher = {mathdoc},
     volume = {33},
     number = {10},
     year = {1993},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/}
}
TY  - JOUR
AU  - V. N. Nefëdov
TI  - The complexity of the computation of a global minimum in certain classes of optimization problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1993
SP  - 1480
EP  - 1498
VL  - 33
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/
LA  - ru
ID  - ZVMMF_1993_33_10_a3
ER  - 
%0 Journal Article
%A V. N. Nefëdov
%T The complexity of the computation of a global minimum in certain classes of optimization problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1993
%P 1480-1498
%V 33
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/
%G ru
%F ZVMMF_1993_33_10_a3
V. N. Nefëdov. The complexity of the computation of a global minimum in certain classes of optimization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 33 (1993) no. 10, pp. 1480-1498. http://geodesic.mathdoc.fr/item/ZVMMF_1993_33_10_a3/