Computer Research and Modeling
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Computer Research and Modeling:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Computer Research and Modeling, 2015, Volume 7, Issue 3, Pages 719–725
DOI: https://doi.org/10.20537/2076-7633-2015-7-3-719-725 (Mi crm240) 		 
This article is cited in 3 scientific papers (total in 3 papers)

СЕКЦИОННЫЕ ДОКЛАДЫ

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

S. A. Smirnov, V. V. Voloshinov

Institute for Information Transmission Problems of the Russian Academy of Science, Kharkevich Institute, 19/1 Bolshoy Karetny per., Moscow, 127051, Russia
Full-text PDF (595 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.20537/2076-7633-2015-7-3-719-725
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.
Funding agency Grant number
Russian Academy of Sciences - Federal Agency for Scientific Organizations 14
Received: 30.09.2014
Document Type: Article
UDC: 004.023
Language: Russian
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
Citation in format AMSBIB
\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:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Computer Research and Modeling
    Statistics & downloads:
    Abstract page:126
    Full-text PDF :64
    References:27
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024