The knapsack problem with generalized upper bounds

The knapsack problem with generalized upper bounds

0.00 Avg rating0 Votes
Article ID: iaor1989327
Country: Netherlands
Volume: 38
Issue: 2
Start Page Number: 242
End Page Number: 254
Publication Date: Jan 1989
Journal: European Journal of Operational Research
Authors:
Keywords: knapsack problem
Abstract:

A particular production planning problem gives rise to a knapsack problem with generalized upper bounds. The paper investigates the efficient solution of this problem via approximation and ‘reduction’. The methodology has general applicability to KnPGUB independently of the current application.

Reviews

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