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

 pdf (596K)

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 inter-process communication capabilities of Erlang. Numerical results show noticeable speedup in comparison to single-threaded CBC instance.

Keywords: branch and bound algorithm, coarse grained parallelism
Citation in English: Computer Research and Modeling, 2015, vol. 7, no. 3, pp. 719-725

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the List of Russian peer-reviewed journals publishing the main research results of PhD and doctoral dissertations.

International Interdisciplinary Conference "Mathematics. Computing. Education"

The journal is included in the RSCI