ParaSCIP

From MaRDI portal
Revision as of 20:07, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:18423



swMATH6292MaRDI QIDQ18423


No author found.





Related Items (30)

Improving branch-and-cut performance by random samplingAlgorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs\texttt{mplrs}: a scalable parallel vertex/facet enumeration codeUsing diversification, communication and parallelism to solve mixed-integer linear programsEstimating the Size of Branch-and-Bound TreesParallelization of the FICO Xpress-OptimizerParallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programsCould we use a million cores to solve an integer program?Distributed Solving of Mixed-Integer Programs with GLPK and ThriftExtension of Mittelmann’s Benchmarks: Comparing the Solvers of SAS and GurobiPEBBL: an object-oriented framework for scalable parallel branch and boundSCIP-Jack -- a solver for STP and variants with parallelization extensionsAn efficient strategy for the activation of MIP relaxations in a multicore global MINLP solverFiberSCIP—A Shared Memory Parallelization of SCIPFrom feasibility to improvement to proof: three phases of solving mixed-integer programsParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputersMinimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear programMIPLIB 2003Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programsA computational study of primal heuristics inside an MI(NL)P solverImproving Strong Branching by PropagationTailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routingThe Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-BoundImproving strong branching by domain propagationParallelization of the FICO Xpress-OptimizerMixed Integer Nonlinear Program for Minimization of Akaike’s Information CriterionA First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on SupercomputersMIPLIB 2017: data-driven compilation of the 6th mixed-integer programming libraryA parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planningLinearization and parallelization schemes for convex mixed-integer nonlinear optimization


This page was built for software: ParaSCIP