SteinLib
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Generating new test instances by evolving in instance space
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
- Exact approaches for solving robust prize-collecting Steiner tree problems
- A practical greedy approximation for the directed Steiner tree problem
- Directed Steiner trees with diffusion costs
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- An Exact Algorithm for the Steiner Forest Problem
- Tree network design avoiding congestion
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- Generalized network design problems.
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Towards optimizing the deployment of optical access networks
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- A branch and cut algorithm for the hierarchical network design problem
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
- scientific article; zbMATH DE number 1926656 (Why is no real title available?)
- An algorithmic framework for the exact solution of tree-star problems
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- The influence of preprocessing on Steiner tree approximations
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
- Exact methods for solving the elementary shortest and longest path problems
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- The dynamic predicate stashing copy problem and the Steiner problem in graphs
- Compiling CP subproblems to MDDs and d-DNNFs
- Coordinated cutting plane generation via multi-objective separation
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Optimal design of hierarchical networks with free main path extremes
- EETTlib
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Computational Integer Programming and Cutting Planes
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- On Steiner trees and minimum spanning trees in hypergraphs
- scientific article; zbMATH DE number 2134200 (Why is no real title available?)
- 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
This page was built for software: SteinLib
