FAST APPROXIMATION ALGORITHMS FOR KNAPSACK AND SUM OF SUBSET PROBLEMS

被引：481

作者：

IBARRA, OH ^{[1
]}

KIM, CE ^{[1
]}

机构：

[1] UNIV MINNESOTA,DEPT COMP INFORMATION & CONTROL SCI,114 MAIN ENGN BLDG,MINNEAPOLIS,MN 55455

来源：

关键词：

D O I：

10.1145/321906.321909

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：463 / 468

页数：6

共 11 条

[1] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1974, 21 (02) : 277 - 292
[2] REDUCTION ALGORITHM FOR ZERO-ONE SINGLE KNAPSACK PROBLEMS
INGARGIOLA, GP
KORSH, JF
[J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1973, 20 (04): : 460 - 463
[3] JOHNSON DS, 1973, 5 ANN ACM S THEOR CO, P38
[4] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85
[5] NEMHAUSER G, 1972, INTEGER PROGRAMMING
[6] DISCRETE DYNAMIC PROGRAMMING AND CAPITAL ALLOCATION
NEMHAUSER, GL
ULLMANN, Z
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 15 (09): : 494 - 505
[7] APPROXIMATE ALGORITHMS FOR 0/1 KNAPSACK PROBLEM
SAHNI, S
[J]. JOURNAL OF THE ACM, 1975, 22 (01) : 115 - 124
[8] SAHNI S, 1974, 745 U MINN COMP SCI
[9] SAHNI S, 1972, 13TH P IEEE S SWITCH, P130
[10] [No title captured]