Branch-and-Bound interval global optimization on shared memory multiprocessors

DOI10.1080/10556780802086300zbMath1154.90573OpenAlexW2154117831MaRDI QIDQ3605195

No author found.

Publication date: 23 February 2009

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780802086300

zbMATH Keywords

global optimizationbranch-and-boundinterval arithmeticparallel algorithmsmultithreadingshared memory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Parallel algorithms in computer science (68W10) Algorithms with automatic result verification (65G20)

Related Items (6)

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ On parallel branch and bound frameworks for global optimization ⋮ Comparison of parallel implementations of the branch-and-bound method for shared memory systems ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ The scalability analysis of a parallel tree search algorithm ⋮ Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

Uses Software

• AMIGO
• INTOPT_90

This page was built for publication: Branch-and-Bound interval global optimization on shared memory multiprocessors