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  -