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. Ceselli
Primo
;
G. Righini
Ultimo
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.
Combinatorial optimization ; Knapsack problem
Settore MAT/09 - Ricerca Operativa
2006
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I metadati presenti in AIR sono rilasciati con licenza CCO mentre i file delle pubblicazioni sono rilasciati con licenza CC BY-SA, salvo diversa indicazione. In caso di violazione di copyright, contattare l'assistenza di AIR

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/24279
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 19
  • ???jsp.display-item.citation.isi??? 15
  • OpenAlex ND
social impact