Forest covers and a polyhedral intersection theorem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 3918119 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A 1-matching blossom-type algorithm for edge covering problems
- An efficient algorithm for minimumk-covers in weighted graphs
- Matroids and the greedy algorithm
- Minimum Covers of Fixed Cardinality in Weighted Graphs
- Reductions to 1–matching polyhedra
- The Concavity and Intersection Properties for Integral Polyhedra
Cited in
(9)- Matroids and a forest cover problem
- Clique-connecting forest and stable set polytopes
- Matching theory -- a sampler: From Dénes König to the present
- A Polyhedral Intersection Theorem for Capacitated Spanning Trees
- On the cardinality constrained matroid polytope
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Lot-sizing polyhedra with a cardinality constraint
- Shellable quasi-forests and their \(h\)-triangles
- Fractional covers for forests and matchings
This page was built for publication: Forest covers and a polyhedral intersection theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121807)
