ParaSCIP
From MaRDI portal
Cited in
(71)- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Mixed integer nonlinear program for minimization of Akaike's information criterion
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- MIPLIB 2003
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- Parallelization of the FICO Xpress-Optimizer
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Parallelization of the FICO Xpress-Optimizer
- Improving strong branching by domain propagation
- 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
- ALPS
- FATCOP
- ZRAM
- PICO
- MIPLIB
- UG
- SoPlex
- SteinLib
- HTCondor MW
- SYMPHONY
- XPRESS
- DSP
- mkc7
- DipPy
- BiCePS
- BLIS
- FiberSCIP
- SAS/OR
- CHiPPS
- MIPLIB2003
- Satin
- SIPLIB
- GCG
- MIRPLib
- COR@L
- PEBBL
- ParaXpress
- CuSPLIB
- ParSSSE
- ParaLEX
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- MULTILSB
- pPCx
- SCIP-Jack
- MAIC
- BOB
- Bob++
- PPBB
- Kendo
- IPET
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- Improving strong branching by propagation
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
- BiqBin
- CapoOne
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Could we use a million cores to solve an integer program?
- Distributed solving of mixed-integer programs with GLPK and Thrift
- Extension of Mittelmann's benchmarks: comparing the solvers of SAS and Gurobi
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Estimating the Size of Branch-and-Bound Trees
- Improving branch-and-cut performance by random sampling
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Using diversification, communication and parallelism to solve mixed-integer linear programs
This page was built for software: ParaSCIP
