EXACT METHODS FOR THE KNAPSACK-PROBLEM AND ITS GENERALIZATIONS

被引：120

作者：

DUDZINSKI, K

WALUKIEWICZ, S

机构：

来源：

关键词：

D O I：

10.1016/0377-2217(87)90165-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：3 / 21

页数：19

共 41 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] THE MULTIPLE-CHOICE NESTED KNAPSACK MODEL [J].

ARMSTRONG, RD ;

SINHA, P ;

ZOLTNERS, AA .

[3]

ARMSTRONG RD, 1983, ACM T MATH SOFTWARE, V2, P184

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

BALAS, E ;

ZEMEL, E .

[5]

Brucker P., 1984, Zeitschrift fur Operations Research, Serie A (Theorie), V28, P29, DOI 10.1007/BF01919085

[6] HARD KNAPSACK-PROBLEMS [J].

CHVATAL, V .

[7]

CROWDER H, 1983, OPERATIONS RES, V31, P801

[8]

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

[9] A FAST ALGORITHM FOR THE LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM [J].

DUDZINSKI, K ;

WALUKIEWICZ, S .

[10]

DUDZINSKI K, 1985, METHODS OPNS RES, V49, P223