SteinLib
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Combinatorial optimization in system configuration design
- Packlib2
- SNDlib
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- BRITE
- The dynamic predicate stashing copy problem and the Steiner problem in graphs
- UG
- Zimpl
- TTPLib
- OGDF
- OR-Library
- A robust and scalable algorithm for the Steiner problem in graphs
- GeoSteiner
- 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
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
- 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
- FiberSCIP
- 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
- Algorithmic expedients for the prize collecting Steiner tree problem
- A note on the generalized Steiner tree polytope
- DIMACS
- Treewidthlib
- Strategyproof auction mechanisms for network procurement
- 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
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- BEAVER
- A branch-and-cut algorithm for the maximum covering cycle problem
- ROPI
- LinTim
- Building optimal Steiner trees on supercomputers by using up to 43,000 cores
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Compiling CP subproblems to MDDs and d-DNNFs
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Geometry-experiment algorithm for Steiner minimal tree problem
- A branch and cut algorithm for the hierarchical network design problem
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
- 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
- DryadOpt
- 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
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Chvátal-Gomory cuts for the Steiner tree problem
- The rainbow Steiner tree problem
- ParaXpress
- K_TREE/K_SUBGRAPH
- Dual heuristics on the exact solution of large Steiner problems
- TimberWolf
- Optimal capacitated ring trees
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint
- A note on the practicality of maximal planar subgraph algorithms
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- SCIP-Jack
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
- scientific article; zbMATH DE number 2134200 (Why is no real title available?)
- Benders decomposition of the passive optical network design problem
- On exact solutions for the minmax regret spanning tree problem
- PPBB
- Graphs and algorithms in communication networks on seven league boots
- Generating new test instances by evolving in instance space
- 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
- Directed Steiner trees with diffusion costs
- A practical greedy approximation for the directed Steiner tree problem
- The influence of preprocessing on Steiner tree approximations
- BPPLIB
- SSTPLib
- Approaches to the Steiner Problem in Networks
- LINERLIB
- lop.gms
- stprbh
This page was built for software: SteinLib
