Article ID Journal Published Year Pages File Type
1142854 Operations Research Letters 2006 11 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An optimization algorithm for a penalized knapsack problem
Authors
, ,