On the rst hand, this report studies the class of Greedy Algorithms in order to nd an as systematic as possible strategy that could be applied to the speciication of some problems to lead to a correct program solving that problem. On the other hand, the standard formalisms underlying the Greedy Algorithms (matroid, greedoid and matroid embedding) which are dependent on the particular type set a...