scientific article; zbMATH DE number 2196280

MaRDI QIDQ5465112zbMATH OpenFDO

Authors Martin Grötschel

Publication date 22 August 2005

zbMATH Keywords

cardinality homogeneous set systemscycles and circuits in matroidsgreedy algorithmpolyhedral combinatoricspolytopesseparation algorithms

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational aspects related to convexity (52B55) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the cardinality constrained matroid polytope
• On cardinality constrained polymatroids
• On cardinality constrained polymatroids
• scientific article; zbMATH DE number 1953186
• Dual consistent systems of linear inequalities and cardinality constrained polytopes

Cited in

(5)

• Dual consistent systems of linear inequalities and cardinality constrained polytopes
• On cardinality constrained polymatroids
• On the cardinality constrained matroid polytope
• Cardinality constrained combinatorial optimization: complexity and polyhedra
• S-hypersimplices, pulling triangulations, and monotone paths

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465112)