Theory of linear and integer programming
Theory of linear and integer programming
Total dual integrality implies local strong unimodularity
Mathematical Programming: Series A and B
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Polyhedra with the Integer Carathéodory Property
Journal of Combinatorial Theory Series B
On the Kth best base of a matroid
Operations Research Letters
| Hi-index | 0.00 |
Let S be a finite set and M = (S,B) be a matroid where B is the set of its bases. We say that a basis B is greedy in M or the pair (M, B) is greedy if, for every sum of bases vector w, the coefficient: λ(B, w) = max{λ ≥ 0 : w - λB is again a sum of bases vector}, where B and its characteristic vector will not be distinguished, is integer. We define a notion of minors for (M, B) pairs and we give a characterization of greedy pairs by excluded minors. This characterization gives a large class of matroids for which an integer Carathéodory's theorem is true.