ParaSCIP

swMATH6292MaRDI QIDQ18423FDOQ18423

Author name not available (Why is that?)

Official website: http://rd.springer.com/chapter/10.1007/978-3-642-24025-6_12

Cited In (64)

• 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
• Parallelization of the FICO Xpress-Optimizer
• Estimating the Size of Branch-and-Bound Trees
• 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?
• 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
• 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
• Distributed solving of mixed-integer programs with GLPK and Thrift
• Extension of Mittelmann's benchmarks: comparing the solvers of SAS and Gurobi
• Improving strong branching by propagation
• FATCOP
• FiberSCIP—A Shared Memory Parallelization of SCIP
• 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
• Parallelization of the FICO Xpress-Optimizer
• MULTILSB
• pPCx
• SCIP-Jack
• MAIC
• BOB
• Bob++
• PPBB
• Kendo
• IPET
• BiqBin
• CapoOne
• 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
• The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• 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