On parallel branch and bound frameworks for global optimization
From MaRDI portal
Recommendations
- Parallel branch-and-bound attraction based methods for global optimzation
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- scientific article; zbMATH DE number 2087412
- scientific article; zbMATH DE number 1304342
- Parallel algorithms for global optimization
- scientific article; zbMATH DE number 802433
- scientific article; zbMATH DE number 1206103
- scientific article; zbMATH DE number 5168311
Cites work
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Anomalies in parallel branch-and-bound algorithms
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- Branch-and-Bound Methods: A Survey
- Customizing methods for global optimization -- a geometric viewpoint
- scientific article; zbMATH DE number 2090690 (Why is no real title available?)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- Introduction to nonlinear and global optimization
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Parallel branch and bound for multidimensional scaling with city-block distances
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Simplicial global optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- The computation of fixed points and applications
- The parallel search bench ZRAM and its applications
Cited in
(15)- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- 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
- Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Template realization of generalized branch and bound algorithm
- scientific article; zbMATH DE number 5168311 (Why is no real title available?)
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- scientific article; zbMATH DE number 1304342 (Why is no real title available?)
- Using of OpenMP for optimal choice of process equipment for multiproduct batch plants
- scientific article; zbMATH DE number 2087412 (Why is no real title available?)
- AN IMPLEMENTATION OF A PARALLEL GENERALIZED BRANCH AND BOUND TEMPLATE
- Efficient acceleration strategies for interval branch-and-bound type methods
- Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
- PEBBL: an object-oriented framework for scalable parallel branch and bound
This page was built for publication: On parallel branch and bound frameworks for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683320)
