Random constrained pseudo-Boolean optimization algorithm for multiprocessor systems and clusters
Lev Aleksandrovich Kazakovtsev · 2012
In this paper, we consider an approach to developing parallel versions of the algorithms based on the modified probability changing method for constrained pseudo-Boolean optimization. Optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems with linear constraints and traveling salesman problem.