TY - GEN A1 - Stephan, Rüdiger T1 - On the cardinality constrained matroid polytope N2 - Edmonds showed that the so-called rank inequalities and the nonnegativity constraints provide a complete linear description of the matroid polytope. By essentially adding Grötschel's cardinality forcing inequalities, we obtain a complete linear description of the cardinality constrained matroid polytope which is the convex hull of the incidence vectors of those independent sets that have a feasible cardinality. Moreover, we show how the separation problem for the cardinality forcing inequalities can be reduced to that for the rank inequalities. We also give necessary and sufficient conditions for a cardinality forcing inequality to be facet defining. T3 - ZIB-Report - 08-08 KW - Matroid-Polytop KW - Kardinalitätsbeschränkung KW - Separationsalgorithmus KW - Matroid Polytope KW - Cardinality constraints KW - Separation algorithm Y1 - 2008 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10614 SN - 1438-0064 ER -