Packing Steiner trees: Polyhedral investigations
type: Item
instance of: scholarly article
title: Packing Steiner trees: Polyhedral investigations
zbMATH Open document ID: 0853.90113
DOI: 10.1007/BF02592085
author: Alexander Martin
author: Martin Grötschel
author: Robert Weismantel
published in: Mathematical Programming. Series A. Series B
publication date: 1996-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 912376
zbMATH Keywords: Steiner tree
zbMATH Keywords: VLSI-design
zbMATH Keywords: facet
zbMATH Keywords: polyhedron
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Routing in grid graphs by cutting planes
cites work: Packing Steiner trees: A cutting plane algorithm and computational results
cites work: Packing Steiner trees: Further facets
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Q3210200
cites work: Q3997942
cites work: Q4023738
cites work: Q3818127
description: scientific article; zbMATH DE number 912376