Steiner tree packing revisited
From MaRDI portal
Publication:1935940
DOI10.1007/s00186-012-0391-8zbMath1261.90074OpenAlexW2015234207MaRDI QIDQ1935940
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
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- The Steiner tree packing problem in VLSI design
- On Steiner trees and minimum spanning trees in hypergraphs
- Packing Steiner trees: Further facets
- Packing Steiner trees: Polyhedral investigations
- Packing Steiner trees: A cutting plane algorithm and computational results
- Pivot and shift -- a mixed integer programming heuristic
- On cut-based inequalities for capacitated network design polyhedra
- Via Minimization with Pin Preassignments and Layer Preference
- A dual ascent approach for steiner tree problems on a directed graph
- Pivot and Complement–A Heuristic for 0-1 Programming
- Solving Steiner tree problems in graphs to optimality
This page was built for publication: Steiner tree packing revisited