Linear objective functions on certain classes of greedoids
A greedoid (E,H) has property L if the greedy algorithm selects a maximal basic word for each linear objective function \(w: H\to {\mathbb{R}}\) defined on H. This paper introduces two necessary and sufficient conditions for greedoids to satisfy property L. (Previous known conditions were only sufficient).
scientific article; zbMATH DE number 3972873