Geodesic
A~polynomially solvable class of two-level nonlinear programming problems
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 2, pp. 89-113.

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

@article{DA_2000_7_2_a8,
     author = {A. V. Plyasunov},
     title = {A~polynomially solvable class of two-level nonlinear programming problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {89--113},
     publisher = {mathdoc},
     volume = {7},
     number = {2},
     year = {2000},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2000_7_2_a8/}
}
TY  - JOUR
AU  - A. V. Plyasunov
TI  - A~polynomially solvable class of two-level nonlinear programming problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 89
EP  - 113
VL  - 7
IS  - 2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2000_7_2_a8/
LA  - ru
ID  - DA_2000_7_2_a8
ER  - 
%0 Journal Article
%A A. V. Plyasunov
%T A~polynomially solvable class of two-level nonlinear programming problems
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 89-113
%V 7
%N 2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2000_7_2_a8/
%G ru
%F DA_2000_7_2_a8
A. V. Plyasunov. A~polynomially solvable class of two-level nonlinear programming problems. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 2, pp. 89-113. https://geodesic-test.mathdoc.fr/item/DA_2000_7_2_a8/