Steiner tree packing revisited

DOI10.1007/S00186-012-0391-8MaRDI QIDQ1935940zbMATH OpenOpenAlexFDO

Authors Thorsten Koch, Nam Dũng Hoàng

Publication date 20 February 2013

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-012-0391-8

zbMATH Keywords

grid graphinteger programmingSteiner tree packing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 108281
• Packing Steiner trees: A cutting plane algorithm and computational results
• Solving Steiner tree problems in graphs to optimality
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• A branch-and-price algorithm for the Steiner tree packing problem.

Cites work

• A dual ascent approach for steiner tree problems on a directed graph
• Combinatorial optimization in VLSI design
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• scientific article; zbMATH DE number 4191148 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 108281 (Why is no real title available?)
• On cut-based inequalities for capacitated network design polyhedra
• On Steiner trees and minimum spanning trees in hypergraphs
• Packing Steiner trees: A cutting plane algorithm and computational results
• Packing Steiner trees: Further facets
• Packing Steiner trees: Polyhedral investigations
• Pivot and Complement–A Heuristic for 0-1 Programming
• Pivot and shift -- a mixed integer programming heuristic
• Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
• Solving Steiner tree problems in graphs to optimality
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• The Steiner tree packing problem in VLSI design
• Via Minimization with Pin Preassignments and Layer Preference

Cited in

(9)

• The Steiner tree packing problem in VLSI design
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Packing Steiner trees: A cutting plane algorithm and computational results
• Hardness and approximation results for packing Steiner trees
• The cavity approach for Steiner trees packing problems
• scientific article; zbMATH DE number 108281 (Why is no real title available?)
• Packing element-disjoint steiner trees
• Implications, conflicts, and reductions for Steiner trees
• Multi-qubit lattice surgery scheduling

Describes a project that uses

Uses Software

• Zimpl
• SteinLib
• BEAVER

This page was built for publication: Steiner tree packing revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935940)