A MIXTURE OF DYNAMIC-PROGRAMMING AND BRANCH-AND-BOUND FOR THE SUBSET-SUM PROBLEM

被引：34

作者：

MARTELLO, S ^{[1
]}

TOTH, P ^{[1
]}

机构：

[1] UNIV FLORENCE,IST INFORMAT & SYSTEMIST,I-50121 FLORENCE,ITALY

来源：

MANAGEMENT SCIENCE | 1984年 / 30卷 / 06期

关键词：

D O I：

10.1287/mnsc.30.6.765

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：765 / 771

页数：7

共 11 条

[1] MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM [J].

AHRENS, JH ;

FINKE, G .

OPERATIONS RESEARCH, 1975, 23 (06) :1099-1109

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

BALAS, E ;

ZEMEL, E .

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

[3]

CHVATAL V, 1980, OPER RES, V28, P402

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

FAALAND, B .

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

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

GENS GV, 1980, LECTURE NOTES CONTRO, V23

[7] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J].

JOHNSON, DS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) :256-278

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

MARTELLO, S ;

TOTH, P .

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

[9] WORST-CASE ANALYSIS OF GREEDY ALGORITHMS FOR THE SUBSET-SUM PROBLEM [J].

MARTELLO, S ;

TOTH, P .

MATHEMATICAL PROGRAMMING, 1984, 28 (02) :198-205

[10]

Martello S., 1977, EUR J OPER RES, V1, P169, DOI [10.1016/0377-2217(77)90024-8, DOI 10.1016/0377-2217(77)90024-8]

← 1 2 →