SCIP-Jack

swMATH18748MaRDI QIDQ30579FDOQ30579

Author name not available (Why is that?)

Official website: http://rd.springer.com/article/10.1007/s12532-016-0114-x

Described by source

• SCIP-Jack -- a solver for STP and variants with parallelization extensions

Cited In (26)

• 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
• FiberSCIP
• ParaSCIP
• FindSteinerTree
• ParaXpress
• ParaLEX
• PPBB
• SSTPLib
• The rainbow Steiner tree problem
• CapoOne
• 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