SCIP-Jack -- a solver for STP and variants with parallelization extensions
From MaRDI portal
Recommendations
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A robust and scalable algorithm for the Steiner problem in graphs
- An algorithm for the steiner problem in graphs
- An SST-based algorithm for the steiner problem in graphs
- Binary Steiner trees: structural results and an exact solution approach
- Conflict analysis in mixed integer programming
- Fast local search for Steiner trees in graphs
- FiberSCIP—A Shared Memory Parallelization of SCIP
- How Many Steiner Terminals Can You Connect in 20 Years?
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 1947441 (Why is no real title available?)
- scientific article; zbMATH DE number 1926656 (Why is no real title available?)
- scientific article; zbMATH DE number 1424547 (Why is no real title available?)
- New Reduction Techniques for the Group Steiner Tree Problem
- On Steiner’s Problem with Rectilinear Distance
- On the Exact Location of Steiner Points in General Dimension
- On the solution of traveling salesman problems
- Progress in Academic computational integer programming
- Rectilinear group Steiner trees and applications in VLSI design
- Reducibility among combinatorial problems
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- SCIP: solving constraint integer programs
- Solving group Steiner problems as Steiner problems.
- Solving Steiner tree problems in graphs to optimality
- The Rectilinear Steiner Tree Problem is NP-Complete
- The Steiner tree problem
- The Steiner tree problem with hop constraints
- Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
Cited in
(24)- A robust and scalable algorithm for the Steiner problem in graphs
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Swap-vertex based neighborhood for Steiner tree problems
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Binary Steiner trees: structural results and an exact solution approach
- Optimal Steiner trees under node and edge privacy conflicts
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- The rainbow Steiner tree problem
- SCIP-Jack
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- Imposing contiguity constraints in political districting models
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Stronger path‐based extended formulation for the Steiner tree problem
- Solving the prize‐collecting Euclidean Steiner tree problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Enabling research through the SCIP Optimization Suite 8.0
- A partition-and-merge algorithm for solving the Steiner tree problem in large graphs
Describes a project that uses
Uses Software
This page was built for publication: SCIP-Jack -- a solver for STP and variants with parallelization extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699618)
