Name
Abstract | ||
|---|---|---|
In this paper we introduce and study the Knapsack Problem with Forfeits. With respect to the classical definition of the problem, we are given a collection of pairs of items, such that the inclusion of both in the solution involves a reduction of the profit. We propose a mathematical formulation and two heuristic algorithms for the problem. Computational results validate the effectiveness of our approaches. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-53262-8_22 | ISCO |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Cerulli | 1 | 252 | 23.85 |
| Ciriaco D'Ambrosio | 2 | 0 | 0.34 |
| A. Raiconi | 3 | 131 | 9.68 |
| Gaetano Vitale | 4 | 0 | 0.34 |