Branch-and-Bound interval global optimization on shared memory multiprocessors
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 802433
- Some new acceleration mechanisms in verified global optimization
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
- On parallel branch and bound frameworks for global optimization
- A parallel interval method implementation for global optimization using dynamic load balancing
Cited in
(9)- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- On parallel branch and bound frameworks for global optimization
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- p-MEMPSODE: parallel and irregular memetic global optimization
- scientific article; zbMATH DE number 2068067 (Why is no real title available?)
- The scalability analysis of a parallel tree search algorithm
- Comparison of parallel implementations of the branch-and-bound method for shared memory systems
- Hybridizing two linear relaxation techniques in interval-based solvers
- Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
This page was built for publication: Branch-and-Bound interval global optimization on shared memory multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605195)