On parallel branch and bound frameworks for global optimization
type: Item
instance of: scholarly article
title: On parallel branch and bound frameworks for global optimization
zbMATH Open document ID: 1386.68213
author: Juan F. R. Herrera
author: José M. G. Salmerón
author: E. M. T. Hendrix
author: Rafael Asenjo
author: L. G. Casado
published in: Journal of Global Optimization
publication date: 2017-12-07T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6816340
zbMATH Keywords: branch-and-bound
zbMATH Keywords: load balancing
zbMATH Keywords: shared-memory
zbMATH Keywords: framework
zbMATH Keywords: TBB
describes a project that uses: PEBBL
describes a project that uses: Intel TBB
describes a project that uses: ALPS
describes a project that uses: ZRAM
describes a project that uses: COIN-OR
describes a project that uses: Bob++
describes a project that uses: PPBB
describes a project that uses: MALLBA
describes a project that uses: SYMPHONY
MaRDI profile type: Publication
Wikidata QID: Q59603059
full work available at URL: s10898-017-0508-y
OpenAlex ID: W2592489102
cites work: Q4813180
cites work: Customizing methods for global optimization -- a geometric viewpoint
cites work: The parallel search bench ZRAM and its applications
cites work: Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
cites work: Branch-and-Bound interval global optimization on shared memory multiprocessors
cites work: PEBBL: an object-oriented framework for scalable parallel branch and bound
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: An algorithm for finding the global maximum of a multimodal, multivariate function
cites work: Introduction to nonlinear and global optimization
cites work: Anomalies in parallel branch-and-bound algorithms
cites work: Branch-and-Bound Methods: A Survey
cites work: Simplicial Global Optimization
cites work: Simplicial Lipschitz optimization without the Lipschitz constant
cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
cites work: The computation of fixed points and applications
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
cites work: Parallel branch and bound for multidimensional scaling with city-block distances
DBLP publication ID: journals/jgo/HerreraSHAC17
DOI: 10.1007/S10898-017-0508-Y
Recommended article: Parallel Branch-and-bound Attraction Based Methods for Global Optimzation
Recommended article: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
Recommended article: Q4738205
Recommended article: Q4251073
Recommended article: Parallel algorithms for global optimization
Recommended article: Q4849607
Recommended article: Q4209154
Recommended article: Q3447250
description: scientific article; zbMATH DE number 6816340