Solving group Steiner problems as Steiner problems.

DOI10.1016/S0377-2217(02)00707-5zbMATH Open1099.90066OpenAlexW2071050202MaRDI QIDQ1420439FDOQ1420439

A. Volgenant, Cees Duin, Stefan Voß

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

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
• scientific article; zbMATH DE number 1031385
• New Reduction Techniques for the Group Steiner Tree Problem

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)

Cites Work

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

Cited In (16)

• General variable neighborhood search approach to group Steiner tree problem
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
• Title not available (Why is that?)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The geometric generalized minimum spanning tree problem with grid clustering
• Some formulations for the group Steiner tree problem
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Title not available (Why is that?)
• Combinatorial optimization in system configuration design
• Solving Steiner trees: Recent advances, challenges, and perspectives
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• The prize-collecting generalized minimum spanning tree problem
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Solving the \(k\)-cardinality assignment problem by transformation
• Upper and lower bounding strategies for the 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)