An SST-based algorithm for the steiner problem in graphs
From MaRDI portal
Publication:3813625
DOI10.1002/NET.3230190102zbMATH Open0662.90083OpenAlexW2134143366MaRDI QIDQ3813625FDOQ3813625
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190102
lower boundSteiner problemundirected graphLagrangean relaxationadditional constraintsshortest spanning tree
Cites Work
Cited In (49)
- The class Steiner minimal tree problem: A lower bound and test problem generation
- Towards a lifecycle oriented design of infrastructure by mathematical optimization
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Parallel algorithms for a multi-level network optimization problem
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
- On the core of the minimum cost Steiner tree game in networks
- Algorithms for a multi-level network optimization problem
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
- A note on relatives to the Held and Karp 1-tree problem
- A test problem generator for the Steiner problem in graphs
- Optimal relay node placement in delay constrained wireless sensor network design
- Optimizing the Design of a Wind Farm Collection Network
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
- Optimal Steiner trees under node and edge privacy conflicts
- Minimax regret spanning arborescences under uncertain costs
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Algorithmic expedients for the prize collecting Steiner tree problem
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- A stabilized column generation scheme for the traveling salesman subtour problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Steiner's problem in graphs: Heuristic methods
- Branch-and-bound as a higher-order function
- Steiner distance stable graphs
- Heuristics for the rural postman problem
- Tree network design avoiding congestion
- Non delayed relax-and-cut algorithms
- The edge-disjoing steiner problem in graphs
- Path-distance heuristic for the Steiner problem in undirected networks
- A heuristic for Euclidean and rectilinear Steiner problems
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Decomposition and dynamic cut generation in integer linear programming
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- An edge elimination test for the Steiner problem in graphs
- A constrained Steiner tree problem
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- An approach for the Steiner problem in directed graphs
- Lateness Minimization in Pairwise Connectivity Restoration Problems
Recommendations
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)
