DIRECT DESCENT BINARY KNAPSACK ALGORITHM

被引：11

作者：

ZOLTNERS, AA

机构：

来源：

关键词：

D O I：

10.1145/322063.322073

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：304 / 311

页数：8

共 12 条

[1] BARR RS, 1975, CCS232 U TEX RES REP
[2] AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS
CABOT, AV
[J]. OPERATIONS RESEARCH, 1970, 18 (02) : 306 - &
[3] DEMBO RS, 1975, CORR756 U WAT DEP CO
[4] RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS
FAYARD, D
PLATEAU, G
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (03) : 272 - 307
[5] FISK JC, 1975, INITIAL BOUNDING PRO
[6] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[7] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1974, 21 (02) : 277 - 292
[8] REDUCTION ALGORITHM FOR ZERO-ONE SINGLE KNAPSACK PROBLEMS
INGARGIOLA, GP
KORSH, JF
[J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1973, 20 (04): : 460 - 463
[9] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM
NAUSS, RM
[J]. MANAGEMENT SCIENCE, 1976, 23 (01) : 27 - 31
[10] ROSS GT, 1976, CCS253 U TEX RES REP