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 …

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 …

This paper focuses on solving the knapsack problem with forfeits (KPF). This variation of the
knapsack problem includes soft conflicts or forfeits, where forfeit pairs consist of two items …

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 …

This work addresses a variant of the maximum flow problem where specific pairs of arcs are
not allowed to carry positive flow simultaneously. Such restrictions are known in the …

The knapsack problem with forfeits belongs to the NP-hard combinatorial optimization family
and arises in various applications like resource allocation, finance, and logistics, where …

This paper presents a hybrid BRKGA (Q-HBRKGA) that combines BRKGA with Q-learning
and a Local Branching technique to solve the Knapsack Problem with Forfeits (KPF). The …

This work address a variant of the knapsack problem, known as the knapsack problem with
forfeits, which has numerous applications. In this variant, a set of items and a conflict graph …

The carousel greedy algorithm (CG) was proposed several years ago as a generalized
greedy algorithm. In this paper, we implement CG to solve linear regression problems with a …

This paper introduces an extended version of the min-Knapsack problem with compactness
constraints (mKPC). The idea is to define penalty values for certain items when they are not …