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

Smirnov S.A., Voloshinov V.V.
 pdf (596K)  / List of references

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: Smirnov S.A., Voloshinov V.V. Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment // Computer Research and Modeling, 2015, vol. 7, no. 3, pp. 719-725
Citation in English: Smirnov S.A., Voloshinov V.V. Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment // Computer Research and Modeling, 2015, vol. 7, no. 3, pp. 719-725
DOI: 10.20537/2076-7633-2015-7-3-719-725
URL: http://crm-en.ics.org.ru/journal/article/2329/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.
Views (last year): 2. Citations: 2 (RSCI).

Indexed in Scopus

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 RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science