AN IMPROVED DIRECT DESCENT ALGORITHM FOR BINARY KNAPSACK-PROBLEMS

被引：1

作者：

MURPHY, RA

机构：

[1] Schneider Natl, Inc, United States

来源：

COMPUTERS & OPERATIONS RESEARCH | 1989年 / 16卷 / 04期

关键词：

Computer Programming--Algorithms - Operations Research--Optimization;

D O I：

10.1016/0305-0548(89)90002-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Several efficient algorithms for solution of the binary knapsack problem have appeared in the literature. The direct descent algorithm is generally recognized as one of the most efficient. This paper improves the direct descent algorithm through a more general fathom and backtrack methodology and stronger reduction tests. The efficiency of these improvements is verified through extensive computational testing.

引用

页码：305 / 313

页数：9

共 11 条

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