The paper describes the design and implementation of BNB-Solver, an object-oriented
framework for discrete and continuous parallel global optimization. The framework supports …

Many of today's complex scientific applications now require a vast amount of computational
power. General purpose graphics processing units (GPGPUs) enable researchers in a …

In this paper, we revisit the design and implementation of Branch-and-Bound (B&B)
algorithms for solving large combinatorial optimization problems on GPU-enhanced multi …

We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that
uses the MPI parallel environment and can be run on a network of computers. The …

In this paper, we address the design and implementation of graphical processing unit (GPU)‐
accelerated branch‐and‐bound algorithms (B&B) for solving flow‐shop scheduling …

Abstract Branch and Bound (B&B) algorithms are known to exhibit an irregularity of the
search tree. Therefore, develo** a parallel approach for this kind of algorithms is a …

Branch-and-Bound (B&B) algorithms are time-intensive tree-based exploration methods for
solving to optimality combinatorial optimization problems. In this paper, we investigate the …

We investigate the design of parallel B&B in large scale heterogeneous compute
environments where processing units can be composed of a mixture of multiple shared …

We present improvements to branch and bound techniques for globally optimizing functions
with Lipschitz continuity properties by develo** novel bounding procedures and …

This work studies how to adapt the number of threads of a parallel Interval Branch and
Bound algorithm to the available computational resources based on its current performance …