Solving Steiner tree problems in graphs to optimality
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Combinatorial optimization in system configuration design
- The role of Steiner hulls in the solution to Steiner tree problems
- Steiner tree problems
- The Steiner tree problem
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- The dynamic predicate stashing copy problem and the Steiner problem in graphs
- SteinLib
- A robust and scalable algorithm for the Steiner problem in graphs
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Thinning out Steiner trees: a node-based model for uniform edge costs
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Binary Steiner trees: structural results and an exact solution approach
- Solving minimum-cost shared arborescence problems
- An algorithmic framework for the exact solution of tree-star problems
- Generalized network design problems.
- Strong lower bounds for the prize collecting Steiner problem in graphs
- On Steiner trees and minimum spanning trees in hypergraphs
- A branch-and-cut algorithm for the Steiner tree problem with delays
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Steiner tree packing revisited
- A note on the generalized Steiner tree polytope
- Optimal Steiner trees under node and edge privacy conflicts
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Stronger MIP formulations for the Steiner forest problem
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- A branch-and-cut algorithm for the maximum covering cycle problem
- Branch-and-cut algorithms for Steiner tree problems with privacy conflicts
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Exact approaches for solving robust prize-collecting Steiner tree problems
- A branch and cut algorithm for the hierarchical network design problem
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- The Steiner connectivity problem
- Coordinated cutting plane generation via multi-objective separation
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- Reduction tests for the prize-collecting Steiner problem
- Viral systems: A new bio-inspired optimisation approach
- Towards optimizing the deployment of optical access networks
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Chvátal-Gomory cuts for the Steiner tree problem
- The rainbow Steiner tree problem
- Dual heuristics on the exact solution of large Steiner problems
- Optimal capacitated ring trees
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- Dimensioning multicast-enabled communications networks
- Benders decomposition of the passive optical network design problem
- On exact solutions for the minmax regret spanning tree problem
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Approaches to the Steiner Problem in Networks
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Dynamic Steiner Tree Problem
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- scientific article; zbMATH DE number 1064585 (Why is no real title available?)
- A branch and cut algorithm for the Steiner problem in graphs
- scientific article; zbMATH DE number 1982172 (Why is no real title available?)
- A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Strong Steiner tree approximations in practice
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Preprocessing Steiner problems from VLSI layout
- scientific article; zbMATH DE number 1852707 (Why is no real title available?)
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Using multiflow formulations to solve the Steiner tree problem in graphs
- An Exact Algorithm for the Steiner Forest Problem
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Exact methods for solving the elementary shortest and longest path problems
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Mathematical Programming Algorithms for Spatial Cloaking
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Learning in combinatorial optimization: what and how to explore
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals
- A branch-and-cut algorithm for the connected max-k-cut problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Vertex covering with capacitated trees
- Robust capacitated Steiner trees and networks with uniform demands
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Tree network design avoiding congestion
This page was built for publication: Solving Steiner tree problems in graphs to optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540078)
