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, 2010, Volume 22, Issue 1, Pages 58–73
DOI: https://doi.org/10.4213/dm1084 (Mi dm1084) 		 
This article is cited in 13 scientific papers (total in 13 papers)

Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem

R. M. Kolpakov, M. A. Posypkin
Full-text PDF (165 kB) Citations (13)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1084
Abstract: This paper is devoted to questions concerning the complexity of solution of the problem on one-dimensional Boolean knapsack by the branch and bound method. For this complexity we obtain two upper bounds. We separate the special case of the knapsack problem where the complexity is polynomially bounded by the dimension of the problem. We also obtain an upper and lower bounds for the complexity of solution by the branch and bound method of the subset sum problem which is a special case of the knapsack problem.
Received: 01.04.2009
English version:
Discrete Mathematics and Applications, 2010, Volume 20, Issue 1, Pages 95–112
DOI: https://doi.org/10.1515/DMA.2010.006
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: R. M. Kolpakov, M. A. Posypkin, “Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem”, Diskr. Mat., 22:1 (2010), 58–73; Discrete Math. Appl., 20:1 (2010), 95–112
Citation in format AMSBIB
\Bibitem{KolPos10}
\by R.~M.~Kolpakov, M.~A.~Posypkin
\paper Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
\jour Diskr. Mat.
\yr 2010
\vol 22
\issue 1
\pages 58--73
\mathnet{http://mi.mathnet.ru/dm1084}
\crossref{https://doi.org/10.4213/dm1084}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2675431}
\zmath{https://zbmath.org/?q=an:05779535}
\elib{https://elibrary.ru/item.asp?id=20730324}
\transl
\jour Discrete Math. Appl.
\yr 2010
\vol 20
\issue 1
\pages 95--112
\crossref{https://doi.org/10.1515/DMA.2010.006}
Linking options:
  • https://www.mathnet.ru/eng/dm1084
  • https://doi.org/10.4213/dm1084
  • https://www.mathnet.ru/eng/dm/v22/i1/p58
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:1564
    Full-text PDF :588
    References:87
    First page:41
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024