Steiner tree packing revisited
type: Item
instance of: scholarly article
title: Steiner tree packing revisited
zbMATH Open document ID: 1261.90074
author: Thorsten Koch
author: Nam Dũng Hoàng
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6137605
zbMATH Keywords: Steiner tree packing
zbMATH Keywords: integer programming
zbMATH Keywords: grid graph
describes a project that uses: Zimpl
describes a project that uses: SteinLib
describes a project that uses: BEAVER
MaRDI profile type: Publication
full work available at URL: s00186-012-0391-8
OpenAlex ID: W2015234207
cites work: The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: Pivot and shift -- a mixed integer programming heuristic
cites work: Comparison of formulations and a heuristic for packing Steiner trees in a graph
cites work: Via Minimization with Pin Preassignments and Layer Preference
cites work: Packing Steiner trees: A cutting plane algorithm and computational results
cites work: Packing Steiner trees: Further facets
cites work: Packing Steiner trees: Polyhedral investigations
cites work: The Steiner tree packing problem in VLSI design
cites work: Combinatorial optimization in VLSI design
cites work: Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Q3210200
cites work: Q3997942
cites work: Q4023738
cites work: On Steiner trees and minimum spanning trees in hypergraphs
cites work: On cut-based inequalities for capacitated network design polyhedra
cites work: A dual ascent approach for steiner tree problems on a directed graph
DOI: 10.1007/S00186-012-0391-8
description: scientific article; zbMATH DE number 6137605