An SST-based algorithm for the steiner problem in graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(61)- Heuristics for the rural postman problem
- The telephonic switching centre network problem: Formalization and computational experience
- An edge elimination test for the Steiner problem in graphs
- A constrained Steiner tree problem
- Branch-and-bound as a higher-order function
- An approach for the Steiner problem in directed graphs
- Path-distance heuristic for the Steiner problem in undirected networks
- A heuristic for Euclidean and rectilinear Steiner problems
- Steiner's problem in graphs: Heuristic methods
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- Algorithms for a multi-level network optimization problem
- Steiner distance stable graphs
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- The class Steiner minimal tree problem: A lower bound and test problem generation
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Solving minimum-cost shared arborescence problems
- On the core of the minimum cost Steiner tree game in networks
- Algorithmic expedients for the prize collecting Steiner tree problem
- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
- Optimal Steiner trees under node and edge privacy conflicts
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Towards a lifecycle oriented design of infrastructure by mathematical optimization
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- A stabilized column generation scheme for the traveling salesman subtour problem
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- The Steiner connectivity problem
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- The Steiner problem in graphs: topological methods of solution
- Decomposition and dynamic cut generation in integer linear programming
- A note on relatives to the Held and Karp 1-tree problem
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- The rainbow Steiner tree problem
- An algorithm to find the link constrained Steiner tree in undirected graphs
- Optimal relay node placement in delay constrained wireless sensor network design
- A dual ascent approach for steiner tree problems on a directed graph
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- scientific article; zbMATH DE number 3917752 (Why is no real title available?)
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- A test problem generator for the Steiner problem in graphs
- A branch and cut algorithm for the Steiner problem in graphs
- A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
- The generalized Steiner cable-trench problem with application to error correction in vascular image analysis
- Parallel algorithms for a multi-level network optimization problem
- The edge-disjoing steiner problem in graphs
- Lateness minimization in pairwise connectivity restoration problems
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- An algorithm for the steiner problem in graphs
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Optimizing the Design of a Wind Farm Collection Network
- Tree network design avoiding congestion
- Non delayed relax-and-cut algorithms
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Minimax regret spanning arborescences under uncertain costs
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
This page was built for publication: An SST-based algorithm for the steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813625)
