ParaSCIP

swMATH6292MaRDI QIDQ18423FDOQ18423

Author name not available (Why is that?)

Cited In (30)

• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• A computational study of primal heuristics inside an MI(NL)P solver
• Improving branch-and-cut performance by random sampling
• MIPLIB 2003
• Improving Strong Branching by Propagation
• Parallelization of the FICO Xpress-Optimizer
• Estimating the Size of Branch-and-Bound Trees
• Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
• Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
• Could we use a million cores to solve an integer program?
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
• The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
• FiberSCIP—A Shared Memory Parallelization of SCIP
• A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers
• Parallelization of the FICO Xpress-Optimizer
• ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
• Improving strong branching by domain propagation
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Distributed Solving of Mixed-Integer Programs with GLPK and Thrift
• Extension of Mittelmann’s Benchmarks: Comparing the Solvers of SAS and Gurobi
• From feasibility to improvement to proof: three phases of solving mixed-integer programs
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

This page was built for software: ParaSCIP