Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2019, Volume 31, Issue 4, Pages 20–37
DOI: https://doi.org/10.4213/dm1526 (Mi dm1526) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method

R. M. Kolpakovab, M. A. Posypkinb

a Lomonosov Moscow State University
b Dorodnitsyn Computing Centre of the Russian Academy of Sciences, Moscow
Full-text PDF (530 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1526
Abstract: An easily implementable recursive parallelization strategy for solving the subset sum problem by the branch-and-bound method is proposed. Two different frontal and balanced variants of this strategy are compared. On an example of a particular case of the subset sum problem we show that the balanced variant is more effective than the frontal one. Moreover, we show that, for the considered particular case of the subset sum problem, the balanced variant is also time optimal.
Keywords: the branch-and-bound method, parallel computational complexity, the subset sum problem.
Funding agency Grant number
Russian Foundation for Basic Research 18-07-00566 А
Received: 25.06.2019
Revised: 06.09.2019
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 5, Pages 313–325
DOI: https://doi.org/10.1515/dma-2020-0028
Bibliographic databases:
Document Type: Article
UDC: 519.854.2
Language: Russian
Citation: R. M. Kolpakov, M. A. Posypkin, “Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method”, Diskr. Mat., 31:4 (2019), 20–37; Discrete Math. Appl., 30:5 (2020), 313–325
Citation in format AMSBIB
\Bibitem{KolPos19}
\by R.~M.~Kolpakov, M.~A.~Posypkin
\paper Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 4
\pages 20--37
\mathnet{http://mi.mathnet.ru/dm1526}
\crossref{https://doi.org/10.4213/dm1526}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4043281}
\elib{https://elibrary.ru/item.asp?id=45175916}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 5
\pages 313--325
\crossref{https://doi.org/10.1515/dma-2020-0028}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000582465000004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85094928036}
Linking options:
  • https://www.mathnet.ru/eng/dm1526
  • https://doi.org/10.4213/dm1526
  • https://www.mathnet.ru/eng/dm/v31/i4/p20
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:370
    Full-text PDF :59
    References:45
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024