UG

swMATH3500MaRDI QIDQ16032

No author found.

Described by source

• The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound

Related Items (24)

Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ \texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Using diversification, communication and parallelism to solve mixed-integer linear programs ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ Could we use a million cores to solve an integer program? ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers ⋮ Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program ⋮ 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 ⋮ Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing ⋮ Improving strong branching by domain propagation ⋮ Parallelization of the FICO Xpress-Optimizer ⋮ Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion ⋮ PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite ⋮ A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ Building optimal Steiner trees on supercomputers by using up to 43,000 cores ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

This page was built for software: UG