Enabling research through the SCIP Optimization Suite 8.0
DOI10.1145/3585516MaRDI QIDQ6601379
Gerald Gamrath, Mathieu Besançon, Frederic Matter, Franziska Schlösser, Tim Donkiewicz, Wei-Kun Chen, Boro Sofranac, Daniel Rehfeldt, Jasper van Doornmalen, Yuji Shinano, Unnamed Author, Katrin Halbig, Steffan Schlein, Philipp Wellner, Felipe Serrano, Christopher Hojny, Jakob Witzig, Leon Eifler, Thorsten Koch, Erik Mühmer, Leona Gottwald, Rolf van der Hulst, Fabian Wegscheider, Stephen J. Maher, Benjamin Müller, Mark G. Turner, Marc E. Pfetsch, Ksenia Bestuzheva, Dieter Weninger, Oliver Gaul, Christoph Graczyk, Ambros M. Gleixner, Antonia Chmiela, Marco E. Lübbecke, Stefan Vigerske
Publication date: 10 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
linear programmingcolumn generationparallelizationbranch-and-cutbranch-and-pricemixed-integer linear programmingmixed-integer nonlinear programmingconstraint integer programmingoptimization solvermixed-integer semidefinite programming
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Orbital branching
- Branching in branch-and-price: A generic scheme
- Mixed-integer bilinear programming problems
- SCIP: solving constraint integer programs
- On compact formulations for integer programs solved by column generation
- Exploiting symmetries in mathematical programming via orbital independence
- Pruning by isomorphism in branch-and-cut
- Exploiting orbits in symmetric ILP
- Symmetry breaking inequalities from the Schreier-Sims table
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- On Steiner trees and minimum spanning trees in hypergraphs
- On the multisource hyperplanes location problem to fitting set of points
- Optimization algorithms for resilient path selection in networks
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- A decomposition heuristic for mixed-integer supply chain problems
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- Wasserstein distance to independence models
- Further results on an abstract model for branching and its application to mixed integer programming
- Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
- Polytopes associated with symmetry handling
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Finding Descriptions of Polytopes via Extended Formulations and Liftings
- Presolve Reductions in Mixed Integer Programming
- Approaches to the Steiner Problem in Networks
- 50 Years of Integer Programming 1958-2008
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A framework for solving mixed-integer semidefinite programs
- The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
- Reducibility among Combinatorial Problems
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- Implications, conflicts, and reductions for Steiner trees
This page was built for publication: Enabling research through the SCIP Optimization Suite 8.0
