APPROXIMATE ALGORITHMS FOR 0/1 KNAPSACK PROBLEM

被引：201

作者：

SAHNI, S ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1145/321864.321873

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：115 / 124

页数：10

共 9 条

[1] COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM [J].

HOROWITZ, E ;

SAHNI, S .

[2] REDUCTION ALGORITHM FOR ZERO-ONE SINGLE KNAPSACK PROBLEMS [J].

INGARGIOLA, GP ;

KORSH, JF .

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 [J].

NEMHAUSER, GL ;

ULLMANN, Z .

MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 15 (09) :494-505

[7]

SAHNI S, 1972, 13TH P IEEE S SWITCH, P130

[8]

SAHNI S, 1973, THESIS CORNELL U

[9]

[No title captured]