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.
An optimization algorithm for a penalized knapsack problem / A. Ceselli, G. Righini. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - 34:4(2006), pp. 394-404.
An optimization algorithm for a penalized knapsack problem
A. CeselliPrimo
;G. RighiniUltimo
2006
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
