Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2021, Number 3, Pages 13–22 (Mi vmumm4398)  
This article is cited in 2 scientific papers (total in 2 papers)

Mathematics

Optimal strategy for solving a special case of the knapsack problem by the branch and bound method

R. M. Kolpakov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (406 kB) Citations (2)
References:
PDF
HTML
Abstract: We consider a particular case of the knapsack problem when the weights of all items are the same and the costs of items take two different values. By a strategy of the solution of the knapsack problem by the branch and bound method we mean the method of selecting of the next subtask from the list of subtasks considered in the solution process in conjunction with the method of selecting of the variable to decompose the selected subtask if it is necessary to perform this decomposition. For the considered particular case of the knapsack problem the optimal strategy of this case solution by the branch and bound method is found.
Key words: the knapsack problem, the branch and bound method, the complexity of a problem solution, the strategy of a solution.
Funding agency Grant number
Russian Foundation for Basic Research 18-07-00566
Received: 25.12.2019
English version:
Moscow University Mathematics Bulletin, 2021, Volume 76, Issue 3, Pages 97–106
DOI: https://doi.org/10.3103/S0027132221030050
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: R. M. Kolpakov, “Optimal strategy for solving a special case of the knapsack problem by the branch and bound method”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 3, 13–22; Moscow University Mathematics Bulletin, 76:3 (2021), 97–106
Citation in format AMSBIB
\Bibitem{Kol21}
\by R.~M.~Kolpakov
\paper Optimal strategy for solving a special case of the knapsack problem by the branch and bound method
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2021
\issue 3
\pages 13--22
\mathnet{http://mi.mathnet.ru/vmumm4398}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=4317662}
\zmath{https://zbmath.org/?q=an:7432168}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2021
\vol 76
\issue 3
\pages 97--106
\crossref{https://doi.org/10.3103/S0027132221030050}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000696545000001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85115174927}
Linking options:
  • https://www.mathnet.ru/eng/vmumm4398
  • https://www.mathnet.ru/eng/vmumm/y2021/i3/p13
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025