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 inter-process communication capabilities of Erlang. Numerical results show noticeable speedup in comparison to singl...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Institute of Computer Science
2015-06-01
|
| Series: | Компьютерные исследования и моделирование |
| Subjects: | |
| Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2015_3/15746.pdf |