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.
Author supplied keywords
Cite
CITATION STYLE
Cerulli, R., D’Ambrosio, C., Raiconi, A., & Vitale, G. (2020). The knapsack problem with forfeits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 263–272). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-53262-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
