Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.orl.2005.06.001 | Oper. Res. Lett. |
Keywords | Field | DocType |
knapsack problem,selected item,largest penalty,combinatorial optimization,penalized knapsack problem,ilp formulation,exact optimization algorithm,profitability | Combinatorics,Mathematical optimization,Continuous knapsack problem,Combinatorial optimization,Optimization algorithm,Linear programming,Knapsack problem,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 4 | Operations Research Letters |
Citations | PageRank | References |
6 | 0.65 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Ceselli | 1 | 341 | 30.53 |
| Giovanni Righini | 2 | 520 | 33.90 |