Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment

The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and interprocess communication capabilities of Erlang. Numerical results show noticeable speedup in comparison to single-threaded CBC instance.