On dominated terms in the general knapsack problem

On dominated terms in the general knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor19991928
Country: Netherlands
Volume: 21
Issue: 1
Start Page Number: 31
End Page Number: 37
Publication Date: Aug 1997
Journal: Operations Research Letters
Authors: ,
Keywords: knapsack problem
Abstract:

A necessary and sufficient condition for the identification of dominated terms in a general knapsack problem is derived. By general, we mean a knapsack problem which is unbounded, equality constrained and which has a parametric right-hand side. The given condition yields recently published results in the literature. A report on computational experiments for large-scale knapsack problems, demonstrating the effectiveness of this approach, is included.

Reviews

Required fields are marked *. Your email address will not be published.