Some formulations for the group Steiner tree problem

DOI10.1016/j.dam.2006.03.028zbMath1113.90132OpenAlexW2171838668MaRDI QIDQ2500536

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

zbMATH Keywords

combinatorial optimizationpolyhedral combinatoricsbranch-and-cut algorithmsinteger programming formulations

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

General variable neighborhood search approach to group Steiner tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Rectilinear group Steiner trees and applications in VLSI design
• Solving group Steiner problems as Steiner problems.
• The class Steiner minimal tree problem: A lower bound and test problem generation
• A note on the generalized Steiner tree polytope
• The Complexity of Multiterminal Cuts
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

This page was built for publication: Some formulations for the group Steiner tree problem