A note on dominance relation in unbounded knapsack problems

  • Authors:

  • Krzysztof Dudziski

  • Affiliations:

  • Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447 Warsaw, Poland

  • Venue:
  • Operations Research Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

The O(n^2) 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.