Pages that link to "Item:Q1919089"
From MaRDI portal
The following pages link to Packing Steiner trees: Polyhedral investigations (Q1919089):
Displaying 9 items.
- The Steiner tree packing problem in VLSI design (Q1373751) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Packing the Steiner trees of a graph (Q3057108) (← links)
- A branch-and-price algorithm for switch-box routing (Q4785215) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
