New Reduction Techniques for the Group Steiner Tree Problem

DOI10.1137/040610891MaRDI QIDQ5426902zbMATH OpenOpenAlexFDO

Authors

Publication date 16 November 2007

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/040610891

zbMATH Keywords

branch-and-cutpreprocessingreduction techniquesSteiner trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Some formulations for the group Steiner tree problem
• Reduction tests for the steiner problem in grapsh
• Solving group Steiner problems as Steiner problems.
• scientific article; zbMATH DE number 2119643
• scientific article; zbMATH DE number 1947441

Cited in

(5)

• Solving group Steiner problems as Steiner problems.
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Some formulations for the group Steiner tree problem
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• General variable neighborhood search approach to group Steiner tree problem

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: New Reduction Techniques 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 Q5426902)