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
- 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
- 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
- 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
- FiberSCIP—A Shared Memory Parallelization of SCIP
- The rainbow Steiner tree problem
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Swap-vertex based neighborhood for Steiner tree problems
- Imposing Contiguity Constraints in Political Districting Models
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
This page was built for software: SCIP-Jack
