RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 2,
2002
Volume 9,
Issue 2,
Pages
3–12
(Mi da196)
This article is cited in
1
paper
On conditions for the solvability of optimization problems by a greedy algorithm
N. I. Glebov
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.8
Received:
20.06.2001
Fulltext:
PDF file (530 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024