EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM

被引：80

作者：

NAUSS, RM ^{[1
]}

机构：

[1] UNIV MISSOURI,SCH BUSINESS ADM,ST LOUIS,MO 63121

来源：

关键词：

D O I：

10.1287/mnsc.23.1.27

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：27 / 31

页数：5

共 10 条

[1] DEMBO RS, 1974, COMMUNICATION MAY
[2] Garfinkel R. S., 1972, INTEGER PROGRAMMING
[3] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[4] INTEGER PROGRAMMING ALGORITHMS - FRAMEWORK AND STATE-OF-ART SURVEY
GEOFFRION, AM
MARSTEN, RE
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09): : 465 - 491
[5] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[6] HAMMER PL, 1972, 41ST M ORSA NEW ORL
[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] NAUSS RM, 1974, THESIS U CALIFORNIA
[10] BRANCH AND BOUND ALGORITHM FOR GENERALIZED ASSIGNMENT PROBLEM
ROSS, GT
SOLAND, RM
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (01) : 91 - 103