AN ALGORITHM FOR THE KNAPSACK-PROBLEM

被引：7

作者：

AKINC, U

机构：

来源：

IIE TRANSACTIONS | 1983年 / 15卷 / 01期

关键词：

D O I：

10.1080/05695558308974610

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

引用

页码：31 / 36

页数：6

共 10 条

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

BALAS, E ;

ZEMEL, E .

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

[2] COMPUTATIONAL RESULTS WITH A BRANCH-AND-BOUND ALGORITHM FOR THE GENERAL KNAPSACK PROBLEM [J].

BULFIN, RL ;

PARKER, RG ;

SHETTY, CM .

NAVAL RESEARCH LOGISTICS, 1979, 26 (01) :41-46

[3] AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS [J].

CABOT, AV .

OPERATIONS RESEARCH, 1970, 18 (02) :306-&

[4] THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1966, 14 (06) :1045-&

[5] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1963, 11 (06) :863-888

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

INGARGIOLA, GP ;

KORSH, JF .

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

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

NAUSS, RM .

MANAGEMENT SCIENCE, 1976, 23 (01) :27-31

[8] KNAPSACK PROBLEM - SURVEY [J].

SALKIN, HM ;

KLUYVER, CAD .

NAVAL RESEARCH LOGISTICS, 1975, 22 (01) :127-144

[9] A FINITE RENEWAL ALGORITHM FOR KNAPSACK AND TURNPIKE MODELS [J].

SHAPIRO, JF ;

WAGNER, HM .

OPERATIONS RESEARCH, 1967, 15 (02) :319-&

[10] AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE [J].

SINGLETON, RC .

COMMUNICATIONS OF THE ACM, 1969, 12 (03) :185-+

← 1 →