A NEW ALGORITHM FOR THE 0-1 KNAPSACK-PROBLEM

被引：98

作者：

MARTELLO, S ^{[1
]}

TOTH, P ^{[1
]}

机构：

[1] UNIV BOLOGNA,SCH ENGN,I-40136 BOLOGNA,ITALY

来源：

MANAGEMENT SCIENCE | 1988年 / 34卷 / 05期

关键词：

D O I：

10.1287/mnsc.34.5.633

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：633 / 644

页数：12

共 15 条

[1] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].

BALAS, E ;

ZEMEL, E .

OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154

[2] DISCRETE-VARIABLE EXTREMUM PROBLEMS [J].

DANTZIG, GB .

OPERATIONS RESEARCH, 1957, 5 (02) :266-277

[3]

DEMBO RS, 1980, METHODS OPERATIONS R, V36, P49

[4]

DUDZINSKI K, 1984, MPD104984 SYST RES I

[5] ALGORITHMUS 47 - AN ALGORITHM FOR THE SOLUTION OF THE 0-1 KNAPSACK-PROBLEM [J].

FAYARD, D ;

PLATEAU, G .

COMPUTING, 1982, 28 (03) :269-287

[6]

Garey Michael R., 1979, COMPUTERS INTRACTABI

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

HOROWITZ, E ;

SAHNI, S .

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

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

INGARGIOLA, GP ;

KORSH, JF .

MANAGEMENT SCIENCE SERIES B-APPLICATION, 1973, 20 (04) :460-463

[9] ALGORITHM FOR SOLUTION OF 0-1 SINGLE KNAPSACK PROBLEM [J].

MARTELLO, S ;

TOTH, P .

COMPUTING, 1978, 21 (01) :81-86

[10] A MIXTURE OF DYNAMIC-PROGRAMMING AND BRANCH-AND-BOUND FOR THE SUBSET-SUM PROBLEM [J].

MARTELLO, S ;

TOTH, P .

MANAGEMENT SCIENCE, 1984, 30 (06) :765-771

← 1 2 →