Solving group Steiner problems as Steiner problems.

DOI10.1016/S0377-2217(02)00707-5MaRDI QIDQ1420439zbMATH OpenOpenAlexFDO

Authors A. Volgenant, Stefan Voß, Cees Duin

Publication date 2 February 2004

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(02)00707-5

zbMATH Keywords

metaheuristicscombinatorial optimisationspanning treegeneralized minimalgroup Steiner problemPilot method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2119643
• The minimum degree group Steiner problem
• Some formulations for the group Steiner tree problem
• A greedy approximation algorithm for the group Steiner problem
• An improved approximation scheme for the Group Steiner Problem
• Approximation algorithm for the group Steiner network problem
• Bounded Degree Group Steiner Tree Problems
• scientific article; zbMATH DE number 139784
• scientific article; zbMATH DE number 1031385
• New Reduction Techniques for the Group Steiner Tree Problem

Cites work

• scientific article; zbMATH DE number 3916324 (Why is no real title available?)
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 219265 (Why is no real title available?)
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• A note on the generalized Steiner tree polytope
• An improved approximation scheme for the Group Steiner Problem
• Class Steiner trees and VLSI-design
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
• Efficient path and vertex exchange in steiner tree algorithms
• Generalized spanning trees
• Network flows. Theory, algorithms, and applications.
• On Finding and Updating Spanning Trees and Shortest Paths
• Path-distance heuristic for the Steiner problem in undirected networks
• Steiner’s problem for set-terminals
• The Steiner tree problem
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs

Cited in

(17)

• New Reduction Techniques for the Group Steiner Tree Problem
• The prize-collecting generalized minimum spanning tree problem
• General variable neighborhood search approach to group Steiner tree problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Solving the \(k\)-cardinality assignment problem by transformation
• Combinatorial optimization in system configuration design
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• The geometric generalized minimum spanning tree problem with grid clustering
• scientific article; zbMATH DE number 139784 (Why is no real title available?)
• scientific article; zbMATH DE number 2230214 (Why is no real title available?)
• Some formulations for the group Steiner tree problem
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Solving Steiner trees: Recent advances, challenges, and perspectives
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

This page was built for publication: Solving group Steiner problems as Steiner problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1420439)