On cardinality constrained polymatroids
From MaRDI portal
Publication:496667
DOI10.1016/j.dam.2011.10.007zbMath1327.52024OpenAlexW2178212581MaRDI QIDQ496667
Jean-Francois Maurras, Rüdiger Stephan, Ingo Spiegelberg
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.007
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- On cardinality constrained cycle and path polytopes
- On matroid intersections
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: On cardinality constrained polymatroids