Cover Image

The SCIP Optimization Suite 10.0

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hojny, Christopher, Besançon, Mathieu, Bestuzheva, Ksenia, Borst, Sander, Dionísio, João, Ehls, Johannes, Eifler, Leon, Ghannam, Mohammed, Gleixner, Ambros, Göß, Adrian, Hoen, Alexander, von Holly-Ponientzietz, Jacob, van der Hulst, Rolf, Kamp, Dominik, Koch, Thorsten, Kofler, Kevin, Lentz, Jurgen, Lübbecke, Marco, Maher, Stephen J., Meinhold, Paul Matti, Mexi, Gioni, Mohr, Til, Mühmer, Erik, Patel, Krunal Kishor, Pfetsch, Marc E., Pokutta, Sebastian, Groba, Chantal Reinartz, Serrano, Felipe, Shinano, Yuji, Turner, Mark, Vigerske, Stefan, Walter, Matthias, Weninger, Dieter, Xu, Liding
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C05, 90C10, 90C11, 90C30, 90C90, 65Y05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The SCIP Optimization Suite 9.0
by: Bolusani, Suresh, et al.
Published: (2024)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)

CHAP: A Hybrid GPU-CPU Heuristic for MIP
by: Tjusila, Gennesaret Kharistio, et al.
Published: (2026)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
by: Fujii, Koichi, et al.
Published: (2023)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

Progressively Strengthening and Tuning MIP Solvers for Reoptimization
by: Patel, Krunal Kishor
Published: (2023)

Bayesian Multi-Topology Express Transportation Network Design under Posterior Predictive Demand, Sorting-Efficiency and Delivery-Time Uncertainty
by: Chatterjee, Debashis
Published: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
by: Schwientek, Jan, et al.
Published: (2025)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Operation of an ambulance fleet under uncertainty
by: Guigues, Vincent, et al.
Published: (2022)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

An uncertainty model for positive-valued parameters with application to robust optimization
by: Tanaka, Tatsuya, et al.
Published: (2026)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
by: Roth, Jake, et al.
Published: (2023)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
by: Ai, Wenbao, et al.
Published: (2024)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)