Steiner's problem in graphs: Heuristic methods
From MaRDI portal
Heuristics for solving the Steiner problem on graphs are discussed. Implementations for an extensive collection of heuristics are used to examine their behaviour on random graphs, euclidean graphs and grid graphs. A substantial summary of the computational results is given.
Recommendations
- Heuristics for the Steiner problem in graphs
- A heuristic for the Steiner problem in graphs
- scientific article; zbMATH DE number 125486
- An algorithm for the steiner problem in graphs
- Publication:4945803
- Approaches to the Steiner Problem in Networks
- scientific article; zbMATH DE number 4010182
- Steiner tree problems
- Steiner tree problems
- Path-distance heuristic for the Steiner problem in undirected networks
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A fast algorithm for Steiner trees
- A faster approximation algorithm for the Steiner problem in graphs
- A faster approximation algorithm for the Steiner problem in graphs
- An algorithm for the steiner problem in graphs
- An edge elimination test for the Steiner problem in graphs
- An integer linear programming approach to the steiner problem in graphs
- An SST-based algorithm for the steiner problem in graphs
- Combinatorial heuristic algorithms with FORTRAN
- scientific article; zbMATH DE number 4139520 (Why is no real title available?)
- scientific article; zbMATH DE number 3917752 (Why is no real title available?)
- scientific article; zbMATH DE number 3918122 (Why is no real title available?)
- scientific article; zbMATH DE number 3985248 (Why is no real title available?)
- scientific article; zbMATH DE number 4049088 (Why is no real title available?)
- scientific article; zbMATH DE number 4063109 (Why is no real title available?)
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 3717342 (Why is no real title available?)
- scientific article; zbMATH DE number 3735154 (Why is no real title available?)
- scientific article; zbMATH DE number 49566 (Why is no real title available?)
- scientific article; zbMATH DE number 3538520 (Why is no real title available?)
- On efficient implementation of an approximation algorithm for the Steiner tree problem
- On finding steiner vertices
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Path-distance heuristic for the Steiner problem in undirected networks
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Reduction tests for the steiner problem in grapsh
- Steiner problem in networks: A survey
- The computation of nearly minimal Steiner trees in graphs
- Une heuristique pour le problème de l'arbre de Steiner
- Worst-case performance of Rayward-Smith's Steiner tree heuristic
Cited in
(28)- Combinatorial optimization in system configuration design
- Path-distance heuristic for the Steiner problem in undirected networks
- A heuristic for Euclidean and rectilinear Steiner problems
- Worst-case performance of some heuristics for Steiner's problem in directed graphs
- Generalized spanning trees
- A robust and scalable algorithm for the Steiner problem in graphs
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Local search for the Steiner tree problem in the Euclidean plane
- A heuristic for the Steiner problem in graphs
- Optimal Steiner trees under node and edge privacy conflicts
- Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree
- The Steiner problem in graphs: topological methods of solution
- Dual heuristics on the exact solution of large Steiner problems
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- scientific article; zbMATH DE number 3871417 (Why is no real title available?)
- scientific article; zbMATH DE number 4139520 (Why is no real title available?)
- Approaches to the Steiner Problem in Networks
- scientific article; zbMATH DE number 4049088 (Why is no real title available?)
- scientific article; zbMATH DE number 11140 (Why is no real title available?)
- scientific article; zbMATH DE number 32742 (Why is no real title available?)
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- scientific article; zbMATH DE number 4128830 (Why is no real title available?)
- scientific article; zbMATH DE number 1926656 (Why is no real title available?)
- A note on distributed multicast routing in point-to-point networks
- Steiner trees and polyhedra
- Improved algorithms for the Steiner problem in networks
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Phase-field approximation for one-dimensional shape optimization problems
This page was built for publication: Steiner's problem in graphs: Heuristic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201819)
