On the spanning tree polyhedron
From MaRDI portal
Publication:1122482
DOI10.1016/0167-6377(89)90029-1zbMath0675.90060MaRDI QIDQ1122482
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90029-1
90C35: Programming involving graphs or networks
05C05: Trees
90C10: Integer programming
90C27: Combinatorial optimization
52Bxx: Polytopes and polyhedra
Related Items
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Separating from the dominant of the spanning tree polytope, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, Generalized network design problems., On two-connected subgraph polytopes, A note on the generalized Steiner tree polytope
Cites Work
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Minimum partition of a matroid into independent subsets
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Blocking and anti-blocking pairs of polyhedra
- Matroids and the greedy algorithm