Glebov, N. I. On solvability conditions for optimization problems by means of the greedy algorithm. (Russian) Zbl 1033.90074 Diskretn. Anal. Issled. Oper., Ser. 2 9, No. 2, 3-12 (2002). Summary: This is a survey of results related to solvability conditions for some integer programming problems (combinatorial optimization) by means of the algorithm of coordinate-wise lift (the greedy algorithm). MSC: 90C10 Integer programming 90C27 Combinatorial optimization 90C59 Approximation methods and heuristics in mathematical programming Keywords:greedoid; linear objective function; matroid optimization; submodular combinatorial structure PDFBibTeX XMLCite \textit{N. I. Glebov}, Diskretn. Anal. Issled. Oper., Ser. 2 9, No. 2, 3--12 (2002; Zbl 1033.90074)