Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method

被引：1
|
作者：
Kolpakov, R. M. [1 ]
机构：
[1] Lomonosov Moscow State Univ, Fac Mech & Math, Chair Discrete Math, Moscow, Russia
来源：
MOSCOW UNIVERSITY MATHEMATICS BULLETIN | 2021年 / 76卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
knapsack problem; branch and bound method; problem solution complexity; solution strategy;
D O I：
10.3103/S0027132221030050
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A particular case of the knapsack problem is considered for which the weights of all items are identical and the costs of the items take just two different values. The solution strategy of the knapsack problem by the branch and bound method is understood as the method for selecting the next subproblem from the list of subproblems treated in the course of the solution process in conjunction with the method for selecting the variable to decompose the selected subproblem 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.
引用
收藏
页码：97 / 106
页数：10
相关论文
共 50 条
  • [1] Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method
    R. M. Kolpakov
    [J]. Moscow University Mathematics Bulletin, 2021, 76 : 97 - 106
  • [2] Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method
    Mikhailyuk, V. A.
    [J]. JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2011, 43 (11) : 48 - 56
  • [3] THE USE OF DUALITY TO INCREASE THE EFFECTIVENESS OF THE BRANCH AND BOUND METHOD WHEN SOLVING THE KNAPSACK-PROBLEM
    ALEKSEYEV, AO
    ALEKSEYEV, OG
    ANISIMOV, VG
    ANISIMOV, EG
    [J]. USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1985, 25 (06): : 50 - 54
  • [4] BRANCH AND BOUND ALGORITHMS - KNAPSACK PROBLEM
    PARSONS, JA
    [J]. JOURNAL OF SYSTEMS MANAGEMENT, 1969, 20 (09): : 35 - 37
  • [5] APPLICATION OF METHOD BRANCH AND BOUND FOR A GENERALIZED KNAPSACK-PROBLEM
    KRAWCZYK, R
    [J]. ANGEWANDTE INFORMATIK, 1971, 13 (10): : 461 - &
  • [6] Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound
    Gallardo, JE
    Cotta, C
    Fernández, AJ
    [J]. ARTIFICIAL INTELLIGENCE AND KNOWLEDGE ENGINEERING APPLICATIONS: A BIOINSPIRED APPROACH, PT 2, PROCEEDINGS, 2005, 3562 : 21 - 30
  • [7] An Out-of-Core Branch and Bound Method for Solving the 0-1 Knapsack Problem on a GPU
    Shen, Jingcheng
    Shigeoka, Kentaro
    Ino, Fumihiko
    Hagihara, Kenichi
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2017, 2017, 10393 : 254 - 267
  • [8] A BRANCH AND BOUND ALGORITHM FOR SOLVING THE MULTIPLE-CHOICE KNAPSACK-PROBLEM
    DYER, ME
    KAYAL, N
    WALKER, J
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1984, 11 (02) : 231 - 249
  • [9] Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
    Kolpakov, R. M.
    Posypkin, M. A.
    [J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (01): : 95 - 112
  • [10] An Analysis of the Branch-and-Bound Method in Solving the Reactive Optimal Power Flow Problem
    Matos, Luiza
    Silva, Daisy
    Soler, Edilaine
    [J]. PROCEEDINGS OF THE 2017 IEEE XXIV INTERNATIONAL CONFERENCE ON ELECTRONICS, ELECTRICAL ENGINEERING AND COMPUTING (INTERCON), 2017,
12345