SCIP-Jack
From MaRDI portal
Software:30579
swMATH18748MaRDI QIDQ30579FDOQ30579
Author name not available (Why is that?)
Cited In (18)
- Building optimal Steiner trees on supercomputers by using up to 43,000 cores
- 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
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Imposing contiguity constraints in political districting models
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- A robust and scalable algorithm for the Steiner problem in graphs
- FiberSCIP—A Shared Memory Parallelization of SCIP
- The rainbow Steiner tree problem
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Swap-vertex based neighborhood for Steiner tree problems
- Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
This page was built for software: SCIP-Jack
