|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 2002, Volume 9, Issue 2, Pages 3–12
(Mi da196)
|
|
|
|
This article is cited in 1 scientific paper (total 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
Received: 20.06.2001
Citation:
N. I. Glebov, “On conditions for the solvability of optimization problems by a greedy algorithm”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002), 3–12
Linking options:
https://www.mathnet.ru/eng/da196 https://www.mathnet.ru/eng/da/v9/s2/i2/p3
|
Statistics & downloads: |
Abstract page: | 343 | Full-text PDF : | 161 | References: | 41 |
|