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

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


Diskr. Mat., 2010, Volume 22, Issue 1, Pages 58–73 (Mi dm1084)  

This article is cited in 5 scientific papers (total in 5 papers)

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

R. M. Kolpakov, M. A. Posypkin


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.

DOI: https://doi.org/10.4213/dm1084

Full text: PDF file (165 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2010, 20:1, 95–112

Bibliographic databases:

UDC: 519.7
Received: 01.04.2009

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://www.ams.org/mathscinet-getitem?mr=2675431}
\zmath{https://zbmath.org/?q=an:05779535}
\elib{http://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:
  • http://mi.mathnet.ru/eng/dm1084
  • https://doi.org/10.4213/dm1084
  • http://mi.mathnet.ru/eng/dm/v22/i1/p58

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Kolpakov R., Posypkin M., “The Lower Bound on Complexity of Parallel Branch-and-Bound Algorithm For Subset Sum Problem”, Numerical Computations: Theory and Algorithms (Numta-2016), AIP Conference Proceedings, 1776, eds. Sergeyev Y., Kvasov D., DellAccio F., Mukhametzhanov M., Amer Inst Physics, 2016, 050008  crossref  isi  scopus
    2. R. M. Kolpakov, M. A. Posypkin, “On the best choice of a branching variable in the subset sum problem”, Discrete Math. Appl., 28:1 (2018), 29–34  mathnet  crossref  crossref  isi  elib
    3. A. Yu. Popkov, B. S. Darkhovsky, Yu. S. Popkov, “Iterative MC-algorithm to solve the global optimization problems”, Autom. Remote Control, 78:2 (2017), 261–275  mathnet  crossref  isi  elib
    4. R. M. Kolpakov, M. A. Posypkin, Si Tu Tant Sin, “Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering”, Autom. Remote Control, 78:3 (2017), 463–474  mathnet  crossref  isi  elib
    5. R. M. Kolpakov, M. A. Posypkin, “Ob effektivnoi strategii rasparallelivaniya pri reshenii zadach o summe podmnozhestv metodom vetvei i granits”, Diskret. matem., 31:4 (2019), 20–37  mathnet  crossref
  • Дискретная математика
    Number of views:
    This page:1065
    Full text:273
    References:55
    First page:41

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020