The following pages link to On the spanning tree polyhedron (Q1122482):
Displaying 17 items.
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- Generalized network design problems. (Q1810478) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Blocking duality for \(p\)-modulus on networks and applications (Q2420264) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Fairest edge usage and minimum expected overlap for random spanning trees (Q2659219) (← links)
- Hepp's bound for Feynman graphs and matroids (Q2693186) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- Spanning tree modulus for secure broadcast games (Q6092624) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
