Article ID: | iaor2007885 |
Country: | Netherlands |
Volume: | 34 |
Issue: | 4 |
Start Page Number: | 394 |
End Page Number: | 404 |
Publication Date: | Jul 2006 |
Journal: | Operations Research Letters |
Authors: | Righini Giovanni, Ceselli Alberto |
Keywords: | optimization |
We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm.