Solving group Steiner problems as Steiner problems.

DOI10.1016/S0377-2217(02)00707-5zbMath1099.90066OpenAlexW2071050202MaRDI QIDQ1420439

A. Volgenant, Stefan Voß, Cees W. 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

metaheuristicsspanning treecombinatorial optimisationgeneralized minimalgroup Steiner problemPilot method

Mathematics Subject Classification ID

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

Related Items (15)

Solving the \(k\)-cardinality assignment problem by transformation ⋮ The geometric generalized minimum spanning tree problem with grid clustering ⋮ General variable neighborhood search approach to group Steiner tree problem ⋮ 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 ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ 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 ⋮ Some formulations for the group Steiner tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Combinatorial optimization in system configuration design ⋮ Unnamed Item ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• Path-distance heuristic for the Steiner problem in undirected networks
• The Steiner tree problem
• Class Steiner trees and VLSI-design
• Generalized spanning trees
• A note on the generalized Steiner tree polytope
• An improved approximation scheme for the Group Steiner Problem
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• On Finding and Updating Spanning Trees and Shortest Paths
• 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 faster approximation algorithm for the Steiner problem in graphs

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