Forest covers and a polyhedral intersection theorem

DOI10.1007/BF01589096zbMATH Open0674.90094MaRDI QIDQ1121807FDOQ1121807

Authors: A. B. Gamble, William R. Pulleyblank 

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• Matroids and a forest cover problem
• Fractional covers for forests and matchings
• scientific article; zbMATH DE number 949664
• Total dual integrality of matching forest constraints
• On the spanning tree polyhedron

zbMATH Keywords

polyhedronfacesedge coversspanning forestperfect matching polytopescover polytopeforest cover of a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polytopes and polyhedra (52Bxx)

Cites Work

• Title not available (Why is that?)
• Matroids and the greedy algorithm
• 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
• Title not available (Why is that?)
• Reductions to 1–matching polyhedra
• The Concavity and Intersection Properties for Integral Polyhedra
• Title not available (Why is that?)

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)