# Greedy algorithm

### From Glossary

Applies when the optimization problem is to decide whether or not to include some
element from a given set. A greedy algorithm begins with no
elements and sequentially selects an element from the feasible set
of remaining elements by myopic optimization.
(The elements could have been sorted by some
criterion, such as associated weights.) This results in an optimal
solution to the problem if and only if there is an underlying
matroid structure (for example, see spanning tree).
Further details are in the supplement, Greedy Algorithms.