Geodesic
On conditions for the solvability of optimization problems by a greedy algorithm
Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 2, pp. 3-12

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

@article{DA_2002_9_2_a0,
     author = {N. I. Glebov},
     title = {On conditions for the solvability of optimization problems by a greedy algorithm},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--12},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2002_9_2_a0/}
}
TY  - JOUR
AU  - N. I. Glebov
TI  - On conditions for the solvability of optimization problems by a greedy algorithm
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2002
SP  - 3
EP  - 12
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2002_9_2_a0/
LA  - ru
ID  - DA_2002_9_2_a0
ER  - 
%0 Journal Article
%A N. I. Glebov
%T On conditions for the solvability of optimization problems by a greedy algorithm
%J Diskretnyj analiz i issledovanie operacij
%D 2002
%P 3-12
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2002_9_2_a0/
%G ru
%F DA_2002_9_2_a0
N. I. Glebov. On conditions for the solvability of optimization problems by a greedy algorithm. Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 2, pp. 3-12. http://geodesic.mathdoc.fr/item/DA_2002_9_2_a0/