Large-scale parallelism for constraint-based local search: the costas array case study
We present the parallel implementation of a constraint-based Local Search algorithm and
investigate its performance on several hardware platforms with several hundreds or …
investigate its performance on several hardware platforms with several hundreds or …
Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments
TT Vu, B Derbel - Future Generation Computer Systems, 2016 - Elsevier
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 …
environments where processing units can be composed of a mixture of multiple shared …
Experiments in parallel constraint-based local search
We present a parallel implementation of a constraint-based local search algorithm and
investigate its performance results on hardware with several hundreds of processors. We …
investigate its performance results on hardware with several hundreds of processors. We …
Estimating parallel runtimes for randomized algorithms in constraint solving
This paper presents a detailed analysis of the scalability and parallelization of Local Search
algorithms for constraint-based and SAT (Boolean satisfiability) solvers. We propose a …
algorithms for constraint-based and SAT (Boolean satisfiability) solvers. We propose a …
Towards ultra-scale Branch-and-Bound using a high-productivity language
T Carneiro, J Gmys, N Melab, D Tuyttens - Future Generation Computer …, 2020 - Elsevier
Due to the highly irregular nature and prohibitive execution times of Branch-and-Bound
(B&B) algorithms applied to combinatorial optimization problems (COPs), their …
(B&B) algorithms applied to combinatorial optimization problems (COPs), their …
An efficient load balancing strategy for grid-based branch and bound algorithm
The most popular parallelization approach of the branch and bound algorithm consists in
building and exploring in parallel the search tree representing the problem being tackled …
building and exploring in parallel the search tree representing the problem being tackled …
P2P design and implementation of a parallel branch and bound algorithm for grids
A Bendjoudi, N Melab, EG Talbi - International Journal of …, 2009 - inderscienceonline.com
Solving optimally large instances of combinatorial optimisation problems using Branch and
Bound (B&B) algorithms is CPU-time intensive and requires a large number of …
Bound (B&B) algorithms is CPU-time intensive and requires a large number of …
A grid-aware MIP solver: Implementation and case studies
EP Mancini, S Marcarelli, I Vasilyev, U Villano - Future Generation …, 2008 - Elsevier
This paper presents a grid-enabled system for solving large-scale mixed integer
programming (MIP) problems. The system has been developed using Globus and MPICH …
programming (MIP) problems. The system has been developed using Globus and MPICH …
Grid'BnB: A Parallel Branch and Bound Framework for Grids
D Caromel, A di Costanzo, L Baduel… - … Computing–HiPC 2007 …, 2007 - Springer
Abstract This article presents Grid'BnB, a parallel branch and bound framework for grids.
Branch and bound (B&B) algorithms find optimal solutions of search problems and NP-hard …
Branch and bound (B&B) algorithms find optimal solutions of search problems and NP-hard …
Distributed B&B: A Pure Peer-to-Peer Approach
M Djamai, B Derbel, N Melab - 2011 IEEE International …, 2011 - ieeexplore.ieee.org
The state-of-the-art large scale approach for solving NP-hard permutation-based problems
using parallel Branch-and-Bound (B&B) techniques is based on a Master-Slave model …
using parallel Branch-and-Bound (B&B) techniques is based on a Master-Slave model …