THE MATROIDAL KNAPSACK - A CLASS OF (OFTEN) WELL-SOLVABLE PROBLEMS

被引：10

作者：

CAMERINI, PM ^{[1
]}

VERCELLIS, C ^{[1
]}

机构：

[1] UNIV MILAN,DEPARTIMENTO MATEMAT,I-20122 MILAN,ITALY

来源：

关键词：

D O I：

10.1016/0167-6377(84)90009-9

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：157 / 162

页数：6

共 15 条

ANDERSON, CW .

[2] A COMPUTATIONAL STUDY OF A MULTIPLE-CHOICE KNAPSACK ALGORITHM [J].

ARMSTRONG, RD ;

KUNG, DS ;

SINHA, P ;

ZOLTNERS, AA .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1983, 9 (02) :184-198

[3]

Ausiello G., 1982, System Modeling and Optimization. Proceedings of the 10th IFIP Conference, P557, DOI 10.1007/BFb0006179

[4]

BRYLAWSKI T, UNPUB COMBINATORIAL, pCH9

[5]

CAMERINI PM, UNPUB COMPLEXITY S 2

[6]

DATRI G, 1978, TR7 CTR NAT RECH SCI

[7]

DEMPSTER MAH, UNPUB MATH OPERATION

[8]

Galambos J., 1987, ASYMPTOTIC THEORY EX, V2nd

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[10]

GERLA M, 1973, UCLAENG7319 U CAL RE