Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method

被引：0

作者：

Mikhailyuk, V. A. ^{[1
]}

机构：

[1] Natl Acad Sci Ukraine, VM Glushkov Cybernet Inst, Kiev, Ukraine

来源：

JOURNAL OF AUTOMATION AND INFORMATION SCIENCES | 2011年 / 43卷 / 11期

关键词：

knapsack problem; postoptimality analysis; branch and bound method;

D O I：

10.1615/JAutomatInfScien.v43.i11.50

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The algorithm of postoptimality analysis is proposed for determining exact solutions of family of knapsack problems including an initial problem. The computational experiment shows that the average time of solving the family problem is at least 10 times less than the time of solving the initial problem by branch and bound method.

引用

页码：48 / 56

页数：9

共 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] Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method
Kolpakov, R. M.
[J]. MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (03) : 97 - 106
[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] RECURSIVE BRANCH AND BOUND ALGORITHM FOR MULTIDIMENSIONAL KNAPSACK PROBLEM
THESEN, A
[J]. NAVAL RESEARCH LOGISTICS, 1975, 22 (02) : 341 - 353

← 1 2 3 4 5 →