Refine
Year of publication
Document Type
- ZIB-Report (21) (remove)
Language
- English (21)
Has Fulltext
- yes (21)
Is part of the Bibliography
- no (21)
Keywords
- mixed-integer programming (5)
- branching rule (4)
- branch-and-bound (3)
- domain propagation (3)
- linear programming (3)
- mixed-integer semidefinite programming (3)
- strong branching (3)
- Steiner tree optimization (2)
- branch-and-cut (2)
- branch-and-price (2)
- column generation framework (2)
- constraint integer programming (2)
- mixed-integer linear programming (2)
- mixed-integer nonlinear programming (2)
- optimization solver (2)
- parallelization (2)
- Branch-and-Cut (1)
- Branch-and-cut (1)
- Branch-and-price (1)
- Column generation (1)
- Constraint integer programming (1)
- DIMACS Challenge (1)
- IP (1)
- LP solver (1)
- LP, MIP, CIP, MINLP, modeling, optimization, SCIP, SoPlex, Zimpl (1)
- Linear programming (1)
- MINLP solver (1)
- MIP (1)
- MIP solver (1)
- MIPLIB (1)
- Mixed Integer Programming (1)
- Mixed-Integer Programming (1)
- Mixed-integer linear programming (1)
- Mixed-integer nonlinear programming (1)
- Mixed-integer semidefinite programming (1)
- Optimization solver (1)
- Parallelization (1)
- Problem Instances (1)
- SCIP-Jack (1)
- Steiner Tree Problem (1)
- Steiner tree problem (1)
- Steiner tree solver (1)
- Steiner tree variants (1)
- branch-cut-and-price framework (1)
- dual degeneracy (1)
- fix-and-propagate (1)
- generic column generation (1)
- large neighborhood search (1)
- maximum-weight connected subgraph (1)
- mixed integer programming (1)
- mixed-integer linear and nonlinear programming (1)
- mixed-integer programming, branch-and-bound, branching rule, strong branching (1)
- mixed-integer programming, large neighborhood search, primal heuristics, domain propagation (1)
- modeling (1)
- multi-criteria optimization (1)
- parallel branch-and-bound (1)
- preprocessing (1)
- presolving (1)
- primal heuristics (1)
- prize-collecting Steiner tree (1)
- search strategy (1)
- simplex method (1)
- supply chain management, supply network optimization, mixed-integer linear programming, primal heuristics, numerical stability, large-scale optimization (1)
- variable selection (1)
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 6.0 of the SCIP Optimization Suite. Besides performance improvements of the MIP and MINLP core achieved by new primal heuristics and a new selection criterion for cutting planes, one focus of this release are decomposition algorithms. Both SCIP and the automatic decomposition solver GCG now include advanced functionality for performing Benders’ decomposition in a generic framework. GCG’s detection loop for structured matrices and the coordination of pricing routines for Dantzig-Wolfe decomposition has been significantly revised for greater flexibility. Two SCIP extensions have been added
to solve the recursive circle packing problem by a problem-specific column generation scheme and to demonstrate the use of the new Benders’ framework for stochastic capacitated facility location. Last, not least, the report presents updates and additions to the other components and extensions of the SCIP Optimization Suite: the LP solver SoPlex, the modeling language Zimpl, the parallelization framework UG, the Steiner tree solver SCIP-Jack, and the mixed-integer semidefinite programming solver SCIP-SDP.