On parallel branch and bound frameworks for global optimization

DOI10.1007/s10898-017-0508-yzbMath1386.68213OpenAlexW2592489102WikidataQ59603059 ScholiaQ59603059MaRDI QIDQ1683320

Leocadio G. Casado, José M. G. Salmerón, Juan F. R. Herrera, Rafael Asenjo, Eligius M. T. Hendrix

Publication date: 7 December 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0508-y

zbMATH Keywords

branch-and-boundload balancingframeworkshared-memoryTBB

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Methods for estimating the global maximum point and the integral of a continuous function on a compact set

Uses Software

• ALPS
• MALLBA
• ZRAM
• COIN-OR
• SYMPHONY
• PEBBL
• Intel TBB
• Bob++
• PPBB

Cites Work

• Unnamed Item
• Parallel branch and bound for multidimensional scaling with city-block distances
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• The computation of fixed points and applications
• The parallel search bench ZRAM and its applications
• Simplicial Lipschitz optimization without the Lipschitz constant
• Customizing methods for global optimization -- a geometric viewpoint
• Introduction to nonlinear and global optimization
• Simplicial Global Optimization
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• Branch-and-Bound interval global optimization on shared memory multiprocessors
• Anomalies in parallel branch-and-bound algorithms
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Branch-and-Bound Methods: A Survey