Cited in
(only showing first 100 items - show all)- The Steiner connectivity problem
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- New Reduction Techniques for the Group Steiner Tree Problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Steiner tree packing revisited
- Strategyproof auction mechanisms for network procurement
- Building optimal Steiner trees on supercomputers by using up to 43,000 cores
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- An exact combinatorial algorithm for minimum graph bisection
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Stronger MIP formulations for the Steiner forest problem
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- Learning in combinatorial optimization: what and how to explore
- A note on the practicality of maximal planar subgraph algorithms
- Chvátal-Gomory cuts for the Steiner tree problem
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
- Dual heuristics on the exact solution of large Steiner problems
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- Optimal capacitated ring trees
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Binary Steiner trees: structural results and an exact solution approach
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Mathematical methods for physical layout of printed circuit boards: an overview
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Solving minimum-cost shared arborescence problems
- scientific article; zbMATH DE number 7651143 (Why is no real title available?)
- A branch-and-cut algorithm for the Steiner tree problem with delays
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Decomposition methods for the two-stage stochastic Steiner tree problem
- scientific article; zbMATH DE number 6321164 (Why is no real title available?)
- Reduction tests for the prize-collecting Steiner problem
- A note on the generalized Steiner tree polytope
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Chance-constrained multi-terminal network design problems
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Strong lower bounds for the prize collecting Steiner problem in graphs
- MIP models for connected facility location: a theoretical and computational study
- Mathematical Programming Algorithms for Spatial Cloaking
- A robust and scalable algorithm for the Steiner problem in graphs
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Packlib2
- SNDlib
- BRITE
- UG
- OGDF
- OR-Library
- GeoSteiner
- TTPLib
- Zimpl
- FiberSCIP
- DIMACS
- Treewidthlib
- BEAVER
- LinTim
- ROPI
- DryadOpt
- ParaXpress
- K_TREE/K_SUBGRAPH
- TimberWolf
- SCIP-Jack
- PPBB
- BPPLIB
- SSTPLib
- LINERLIB
- lop.gms
- stprbh
- k-Vertex-Cut-Problem
- OpenGraphGym
- Geometry-experiment algorithm for Steiner minimal tree problem
- Benders decomposition of the passive optical network design problem
- Graphs and algorithms in communication networks on seven league boots
- Approaches to the Steiner Problem in Networks
- Distance transformation for network design problems
- Cost optimized layout of fibre optic networks in the access net domain
- Algorithmic expedients for the prize collecting Steiner tree problem
- Combinatorial optimization in system configuration design
- On exact solutions for the minmax regret spanning tree problem
- Viral systems: A new bio-inspired optimisation approach
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
- How Many Steiner Terminals Can You Connect in 20 Years?
- A branch-and-cut algorithm for the maximum covering cycle problem
- Preprocessing Steiner problems from VLSI layout
- The rainbow Steiner tree problem
This page was built for software: SteinLib
