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