Pages that link to "Item:Q1908272"
From MaRDI portal
The following pages link to Packing Steiner trees: Further facets (Q1908272):
Displaying 17 items.
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- The Steiner tree packing problem in VLSI design (Q1373751) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- The cavity approach for Steiner trees packing problems (Q3303270) (← links)
- (Q4023738) (← links)
- Packing element-disjoint steiner trees (Q4962687) (← links)
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope (Q5244302) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)