A FULLY POLYNOMIAL-APPROXIMATION ALGORITHM FOR THE 0-1 KNAPSACK-PROBLEM

被引：38

作者：

MAGAZINE, MJ ^{[1
]}

OGUZ, O ^{[1
]}

机构：

[1] MIDDLE E TECH UNIV,DEPT OPERAT RES & STAT,ANKARA,TURKEY

来源：

关键词：

D O I：

10.1016/0377-2217(81)90175-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：270 / 273

页数：4

共 6 条

[1] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

[2]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[3] ALGORITHM FOR 0-1 KNAPSACK PROBLEM [J].

LAURIERE, M .

[4]

Lawler E. L., 1977, 18th Annual Symposium on Foundations of Computer Science, P206, DOI 10.1109/SFCS.1977.11

[5] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM [J].

NAUSS, RM .

SUHL, U .