THE USE OF DUALITY TO INCREASE THE EFFECTIVENESS OF THE BRANCH AND BOUND METHOD WHEN SOLVING THE KNAPSACK-PROBLEM

被引：3

|

作者：

ALEKSEYEV, AO

ALEKSEYEV, OG

ANISIMOV, VG

ANISIMOV, EG

机构：

来源：

USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 1985年 / 25卷 / 06期

关键词：

D O I：

10.1016/0041-5553(85)90008-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：50 / 54

页数：5

相关论文

共 50 条

[1] APPLICATION OF METHOD BRANCH AND BOUND FOR A GENERALIZED KNAPSACK-PROBLEM
KRAWCZYK, R
[J]. ANGEWANDTE INFORMATIK, 1971, 13 (10): : 461 - &
[2] 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
[3] THE USE OF DUALITY TO IMPROVE THE EFFICIENCY OF METHODS OF SOLVING THE QUADRATIC KNAPSACK-PROBLEM
KISELEV, VD
SUKMANOV, SA
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1993, 33 (02) : 287 - 288
[4] 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
[5] A SUBEXPONENTIAL ALGORITHM FOR SOLVING THE KNAPSACK-PROBLEM
VOLOSHIN, AF
MASHCHENKO, SO
[J]. DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1986, (10): : 54 - 57
[6] 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
[7] 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
[8] THE USE OF DUALITY TO DETERMINE THE BRANCHING ORDER OF VARIABLES AND TO ESTIMATE THE BOUNDS IN THE SOLUTION OF THE KNAPSACK-PROBLEM
ALEKSEYEV, AO
ALEKSEYEV, OG
KISELEV, VD
[J]. USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1990, 30 (02): : 199 - 200
[9] A BOUND AND BOUND ALGORITHM FOR THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
MARTELLO, S
TOTH, P
[J]. DISCRETE APPLIED MATHEMATICS, 1981, 3 (04) : 275 - 288
[10] BRANCH AND BOUND ALGORITHMS - KNAPSACK PROBLEM
PARSONS, JA
[J]. JOURNAL OF SYSTEMS MANAGEMENT, 1969, 20 (09): : 35 - 37

← 1 2 3 4 5 →