Packing Steiner trees: Further facets
From MaRDI portal
Recommendations
Cited in
(19)- scientific article; zbMATH DE number 108281 (Why is no real title available?)
- The cavity approach for Steiner trees packing problems
- Hardness and approximation results for packing Steiner trees
- A branch-and-price algorithm for the Steiner tree packing problem.
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Steiner trees and polyhedra
- Packing Steiner trees: A cutting plane algorithm and computational results
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope
- Chvátal-Gomory cuts for the Steiner tree problem
- Packing element-disjoint steiner trees
- Packing Steiner trees: Polyhedral investigations
- Packing trees in communication networks
- Steiner tree packing revisited
- Packings and Steiner systems in polar spaces
- The Steiner tree packing problem in VLSI design
- scientific article; zbMATH DE number 2196275 (Why is no real title available?)
- Mathematical methods for physical layout of printed circuit boards: an overview
- The Steiner tree problem. II: Properties and classes of facets
This page was built for publication: Packing Steiner trees: Further facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908272)