Steiner tree packing revisited
From MaRDI portal
Publication:1935940
DOI10.1007/S00186-012-0391-8zbMATH Open1261.90074OpenAlexW2015234207MaRDI QIDQ1935940FDOQ1935940
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
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.
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11)
Cites Work
- Solving Steiner tree problems in graphs to optimality
- Via Minimization with Pin Preassignments and Layer Preference
- On cut-based inequalities for capacitated network design polyhedra
- Title not available (Why is that?)
- A dual ascent approach for steiner tree problems on a directed graph
- The Steiner tree packing problem in VLSI design
- Packing Steiner trees: A cutting plane algorithm and computational results
- On Steiner trees and minimum spanning trees in hypergraphs
- Pivot and Complement–A Heuristic for 0-1 Programming
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Pivot and shift -- a mixed integer programming heuristic
- Combinatorial optimization in VLSI design
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Title not available (Why is that?)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- Packing Steiner trees: Further facets
- Packing Steiner trees: Polyhedral investigations
- Title not available (Why is that?)
Cited In (8)
- Packing element-disjoint steiner trees
- Implications, conflicts, and reductions for Steiner trees
- The cavity approach for Steiner trees packing problems
- Title not available (Why is that?)
- The Steiner tree packing problem in VLSI design
- Hardness and approximation results for packing Steiner trees
- Packing Steiner trees: A cutting plane algorithm and computational results
- Thinning out Steiner trees: a node-based model for uniform edge costs
Uses Software
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)
