MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM

被引：31

作者：

AHRENS, JH ^{[1
]}

FINKE, G ^{[1
]}

机构：

[1] NOVA SCOTIA TECH COLL,HALIFAX,NOVA SCOTIA,CANADA

来源：

OPERATIONS RESEARCH | 1975年 / 23卷 / 06期

关键词：

D O I：

10.1287/opre.23.6.1099

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1099 / 1109

页数：11

共 13 条

[1] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].

BALINSKI, ML .

MANAGEMENT SCIENCE, 1965, 12 (03) :253-313

[2] SOLUTION OF VALUE-INDEPENDENT KNAPSACK PROBLEM BY PARTITIONING [J].

FAALAND, B .

OPERATIONS RESEARCH, 1973, 21 (01) :332-337

[3] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].

GREENBERG, H ;

HEGERICH, RL .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332

[4] MIXED-INTEGER ALGORITHMS FOR (0,1) KNAPSACK PROBLEM [J].

GUIGNARD, MM ;

SPIELBERG, K .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1972, 16 (04) :424-+

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

HOROWITZ, E ;

SAHNI, S .

JOURNAL OF THE ACM, 1974, 21 (02) :277-292

[6]

Jeroslow R. G., 1974, Mathematical Programming, V6, P105, DOI 10.1007/BF01580225

[7]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[8]

MORIN TL, TO BE PUBLISHED

[9] DISCRETE DYNAMIC PROGRAMMING AND CAPITAL ALLOCATION [J].

NEMHAUSER, GL ;

ULLMANN, Z .

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

[10] APPLICATION OF COMBINATORIAL PROGRAMMING TO A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMS [J].

PIERCE, JF .

MANAGEMENT SCIENCE, 1968, 15 (03) :191-209

← 1 2 →