Forest covers and a polyhedral intersection theorem
From MaRDI portal
Publication:1121807
DOI10.1007/BF01589096zbMath0674.90094MaRDI QIDQ1121807
A. B. Gamble, William R. Pulleyblank
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
polyhedronfacesedge coversspanning forestperfect matching polytopescover polytopeforest cover of a graph
Related Items (5)
Matroids and a forest cover problem ⋮ On the cardinality constrained matroid polytope ⋮ Lot-sizing polyhedra with a cardinality constraint ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reductions to 1–matching polyhedra
- The Concavity and Intersection Properties for Integral Polyhedra
- A 1-matching blossom-type algorithm for edge covering problems
- An efficient algorithm for minimumk-covers in weighted graphs
- Minimum Covers of Fixed Cardinality in Weighted Graphs
- Matroids and the greedy algorithm
This page was built for publication: Forest covers and a polyhedral intersection theorem
