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

DOI10.1007/S12532-016-0114-XzbMath1387.90133OpenAlexW2528914664MaRDI QIDQ1699618

Gerald Gamrath, Thorsten Koch, Stephen J. Maher, Yuji Shinano, Daniel Rehfeldt

Publication date: 23 February 2018

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-016-0114-x

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (22)

A robust and scalable algorithm for the Steiner problem in graphs ⋮ Optimal Steiner trees under node and edge privacy conflicts ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ The rainbow Steiner tree problem ⋮ Stronger path‐based extended formulation for the Steiner tree problem ⋮ Solving the prize‐collecting Euclidean Steiner tree problem ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ SCIP-Jack

Uses Software

• SCIP
• UG
• SoPlex
• SteinLib
• Benchmarks for Optimization Software
• FiberSCIP
• ParaSCIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• On the solution of traveling salesman problems
• The Steiner tree problem
• The Steiner tree problem with hop constraints
• Rectilinear group Steiner trees and applications in VLSI design
• Solving group Steiner problems as Steiner problems.
• A robust and scalable algorithm for the Steiner problem in graphs
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Binary Steiner trees: structural results and an exact solution approach
• Conflict analysis in mixed integer programming
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• A dual ascent approach for steiner tree problems on a directed graph
• An SST-based algorithm for the steiner problem in graphs
• On the Exact Location of Steiner Points in General Dimension
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Solving Steiner tree problems in graphs to optimality
• Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
• Reducibility among Combinatorial Problems
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Fast Local Search for Steiner Trees in Graphs
• How Many Steiner Terminals Can You Connect in 20 Years?
• Progress in Academic Computational Integer Programming
• New Reduction Techniques for the Group Steiner Tree Problem
• On Steiner’s Problem with Rectilinear Distance
• An algorithm for the steiner problem in graphs

This page was built for publication: SCIP-Jack -- a solver for STP and variants with parallelization extensions