Abstract:
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.
Keywords:
branch and bound algorithm, coarse grained parallelism.
Citation:
S. A. Smirnov, V. V. Voloshinov, “Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment”, Computer Research and Modeling, 7:3 (2015), 719–725
\Bibitem{SmiVol15}
\by S.~A.~Smirnov, V.~V.~Voloshinov
\paper Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment
\jour Computer Research and Modeling
\yr 2015
\vol 7
\issue 3
\pages 719--725
\mathnet{http://mi.mathnet.ru/crm240}
\crossref{https://doi.org/10.20537/2076-7633-2015-7-3-719-725}
Linking options:
https://www.mathnet.ru/eng/crm240
https://www.mathnet.ru/eng/crm/v7/i3/p719
This publication is cited in the following 3 articles:
V. V. Voloshinov, S. A. Smirnov, “Otsenka proizvoditelnosti krupnoblochnogo algoritma metoda vetvei i granits v vychislitelnoi srede Everest”, Programmnye sistemy: teoriya i prilozheniya, 8:1 (2017), 105–119
Sergey Smirnov, Vladimir Voloshinov, “Implementation of Concurrent Parallelization of Branch-and-bound algorithm in Everest Distributed Environment”, Procedia Computer Science, 119 (2017), 83
Vladimir Voloshinov, Sergey Smirnov, Oleg Sukhoroslov, “Implementation and Use of Coarse-grained Parallel Branch-and-bound in Everest Distributed Environment”, Procedia Computer Science, 108 (2017), 1532
Citation in format AMSBIB
Contact us: