Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
From MaRDI portal
Publication:6166897
Recommendations
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Anomalies in parallel branch-and-bound algorithms
- Performance of parallel branch-and-bound algorithms
- Performances of parallel branch and bound algorithms with best-first search
- scientific article; zbMATH DE number 1304342
Cites work
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- Anomalies in parallel branch-and-bound algorithms
- Branching rules revisited
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed-integer nonlinear optimization
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Parallelization of the FICO Xpress-Optimizer
- Performances of parallel branch and bound algorithms with best-first search
This page was built for publication: Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166897)