Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

Sander Borst

The SCIP Optimization Suite 10.0

Published: 2025/11/24
  • Christopher Hojny
  • Mathieu Besançon
  • Ksenia Bestuzheva
  • Sander Borst
  • Antonia Chmiela
  • João Dionísio
  • Leon Eifler
  • Mohammed Ghannam
  • Ambros Gleixner
  • Adrian Göß
  • Alexander Hoen
  • Rolf van der Hulst
  • Dominik Kamp
  • Thorsten Koch
  • Kevin Kofler
  • Jurgen Lentz
  • Stephen J. Maher
  • Gioni Mexi
  • Erik Mühmer
  • Marc E. Pfetsch
  • Sebastian Pokutta
  • Felipe Serrano
  • Yuji Shinano
  • Mark Turner
  • Stefan Vigerske
  • Matthias Walter
  • Dieter Weninger
  • Liding Xu
  • Categories Integer Programming, Linear, Cone and Semidefinite Programming, Optimization Software and Modeling Systems Tags branch-and-cut algorithm, Branch-and-price algorithm, column generation, constraint integer programming, linear programming, mixed-integer linear programming, mixed-integer nonlinear programming, mixed-integer semidefinite programming, optimization solver, parallelization

    The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in SCIP Optimization Suite 10.0. The updates in SCIP 10.0 include a new solving mode for exactly solving rational mixed-integer linear programs, a new presolver … Read more

    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity convergence rate convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2025 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.