Some formulations for the group Steiner tree problem
DOI10.1016/J.DAM.2006.03.028zbMATH Open1113.90132OpenAlexW2171838668MaRDI QIDQ2500536FDOQ2500536
Authors: Yanyan Li 
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.028
Recommendations
- scientific article; zbMATH DE number 1303564
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- scientific article; zbMATH DE number 2119643
- New Reduction Techniques for the Group Steiner Tree Problem
- Approximation algorithm for the group Steiner network problem
- A greedy approximation algorithm for the group Steiner problem
- Solving group Steiner problems as Steiner problems.
- Bounded Degree Group Steiner Tree Problems
- An improved approximation scheme for the Group Steiner Problem
- A catalog of steiner tree formulations
combinatorial optimizationpolyhedral combinatoricsbranch-and-cut algorithmsinteger programming formulations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- A theorem on flows in networks
- The Complexity of Multiterminal Cuts
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving group Steiner problems as Steiner problems.
- Rectilinear group Steiner trees and applications in VLSI design
- A note on the generalized Steiner tree polytope
- The class Steiner minimal tree problem: A lower bound and test problem generation
Cited In (3)
This page was built for publication: Some formulations for the group Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500536)
