Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
From MaRDI portal
Publication:6166897
DOI10.1007/978-3-031-18530-4_11zbMATH Open1528.90163OpenAlexW4312850195MaRDI QIDQ6166897FDOQ6166897
Authors:
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_11
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Parallelization of the FICO Xpress-Optimizer
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Minotaur: a mixed-integer nonlinear optimization toolkit
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Mixed-integer nonlinear optimization
- Branching rules revisited
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Performances of parallel branch and bound algorithms with best-first search
- Title not available (Why is that?)
- Anomalies in parallel branch-and-bound algorithms
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
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)
