A NOTE ON DOMINANCE RELATION IN UNBOUNDED KNAPSACK-PROBLEMS

被引：5

作者：

DUDZINSKI, K

机构：

[1] Systems Research Institute, Polish Academy of Sciences, 01-447 Warsaw

来源：

OPERATIONS RESEARCH LETTERS | 1991年 / 10卷 / 07期

关键词：

KNAPSACK PROBLEM; DOMINANCE RELATION; PARTIAL ORDER;

D O I：

10.1016/0167-6377(91)90044-P

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The O(n2) elimination of dominated items procedure is an important part of the algorithm of S. Martello and P. Toth (1990) for solving the unbounded knapsack problem. We show that the dominance relation is a partial order and therefore more efficient known elimination procedures can be used.

引用

页码：417 / 419

页数：3