pith. sign in

arxiv: 2112.08872 · v1 · pith:YE5RDMGSnew · submitted 2021-12-16 · 🧮 math.OC

The SCIP Optimization Suite 8.0

Ksenia Bestuzheva , Mathieu Besan\c{c}on , Wei-Kun Chen , Antonia Chmiela , Tim Donkiewicz , Jasper van Doornmalen , Leon Eifler , Oliver Gaul
show 27 more authors
Gerald Gamrath Ambros Gleixner Leona Gottwald Christoph Graczyk Katrin Halbig Alexander Hoen Christopher Hojny Rolf van der Hulst Thorsten Koch Marco L\"ubbecke Stephen J. Maher Frederic Matter Erik M\"uhmer Benjamin M\"uller Marc E. Pfetsch Daniel Rehfeldt Steffan Schlein Franziska Schl\"osser Felipe Serrano Yuji Shinano Boro Sofranac Mark Turner Stefan Vigerske Fabian Wegscheider Philipp Wellner Dieter Weninger Jakob Witzig
This is my paper
classification 🧮 math.OC
keywords scipoptimizationsuiteaddedframeworkimprovementsmajoradditional
0
0 comments X
read the original abstract

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 8.0 of the SCIP Optimization Suite. Major updates in SCIP include improvements in symmetry handling and decomposition algorithms, new cutting planes, a new plugin type for cut selection, and a complete rework of the way nonlinear constraints are handled. Additionally, SCIP 8.0 now supports interfaces for Julia as well as Matlab. Further, UG now includes a unified framework to parallelize all solvers, a utility to analyze computational experiments has been added to GCG, dual solutions can be postsolved by PaPILO, new heuristics and presolving methods were added to SCIP-SDP, and additional problem classes and major performance improvements are available in SCIP-Jack.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. RL-SPH: Learning to Achieve Feasible Solutions for Integer Linear Programs

    cs.LG 2024-11 unverdicted novelty 6.0

    RL-SPH is a reinforcement learning start primal heuristic that independently produces feasible solutions for ILPs with non-binary integers at 100% rate and with 28.6× lower primal gap than prior start heuristics.