After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

We consider the bilevel knapsack problem with interdiction constraints, an extension of the
classic 0–1 knapsack problem formulated as a Stackelberg game with two agents, a leader …

This work introduces a novel extension of the 0/1 Knapsack Problem in which we consider
the existence of so-called forfeit sets. A forfeit set is a subset of items of arbitrary cardinality …

Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties
(MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and …

In this paper, we present a novel hybrid metaheuristic for the Knapsack Problem with Forfeits
(KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a …

We consider integer optimization problems where variables can potentially take fractional
values, but this occurrence is penalized in the objective function. This general situation has …

Abstract We consider the 0–1 Incremental Knapsack Problem (IKP) where the capacity
grows over time periods and if an item is placed in the knapsack in a certain period, it cannot …

Abstract The optimization of Multidimensional Knapsacks with Family‐Split Penalties has
been introduced in the literature as a variant of the more classical Multidimensional …

This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of
the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices …

Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …