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, 2017, Volume 29, Issue 1, Pages 51–58
DOI: https://doi.org/10.4213/dm1405 (Mi dm1405) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On the best choice of a branching variable in the subset sum problem

R. M. Kolpakovab, M. A. Posypkinb

a Lomonosov Moscow State University
b Federal Research Center "Computer Science and Control" of Russian Academy of Sciences
Full-text PDF (391 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1405
Abstract: The paper is concerned with estimating the computational complexity of the branch-and-bound method for the subset sum problem. We study the relationship between the way of decomposition of subproblems and the number of the method steps. The standard variant of the branch-and-bound method for the subset sum problem with binary branching is considered: any subproblem is decomposed into two more simple subproblems by assigning values $0$ and $1$ to a selected branching variable. It is shown that for any set of parameters of the problem the procedure of branching variables selection in the descending order of their weights is optimal.
Keywords: the branch-and-bound method, computational complexity, the subset sum problem.
Funding agency Grant number
Russian Foundation for Basic Research 15-07-03102_а
Ministry of Education and Science of the Russian Federation НШ-8860.2016.1
This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 15-07-03102 A) and the Programme of the President of the Russian Federation for the Support of Leading Scientific Schools (grant no. NSh-8860.2016.1).
Received: 31.10.2016
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 1, Pages 29–34
DOI: https://doi.org/10.1515/dma-2018-0004
Bibliographic databases:
Document Type: Article
UDC: 519.854.2
Language: Russian
Citation: R. M. Kolpakov, M. A. Posypkin, “On the best choice of a branching variable in the subset sum problem”, Diskr. Mat., 29:1 (2017), 51–58; Discrete Math. Appl., 28:1 (2018), 29–34
Citation in format AMSBIB
\Bibitem{KolPos17}
\by R.~M.~Kolpakov, M.~A.~Posypkin
\paper On the best choice of a~branching variable in the subset sum problem
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 1
\pages 51--58
\mathnet{http://mi.mathnet.ru/dm1405}
\crossref{https://doi.org/10.4213/dm1405}
\elib{https://elibrary.ru/item.asp?id=28405135}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 1
\pages 29--34
\crossref{https://doi.org/10.1515/dma-2018-0004}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000425893900004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85054968824}
Linking options:
  • https://www.mathnet.ru/eng/dm1405
  • https://doi.org/10.4213/dm1405
  • https://www.mathnet.ru/eng/dm/v29/i1/p51
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:2105
    Full-text PDF :54
    References:48
    First page:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024