Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization

DOI10.1007/978-3-031-18530-4_11zbMath1528.90163OpenAlexW4312850195MaRDI QIDQ6166897

No author found.

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

zbMATH Keywords

mixed-integer nonlinear programminganomaliesparallel branch-and-boundLP/NLP based branch-and-bound

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Minotaur: a mixed-integer nonlinear optimization toolkit
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Branching rules revisited
• Performances of parallel branch and bound algorithms with best-first search
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Anomalies in parallel branch-and-bound algorithms
• Parallelization of the FICO Xpress-Optimizer
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Mixed-integer nonlinear optimization

This page was built for publication: Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization