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 …

The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem
(0-1 KP) in which a set of item groups is included and each group consists of three items …

As an expanded classical 0-1 knapsack problem (0-1 KP), the discounted {0-1} knapsack
problem (DKP) is proposed based on the concept of discount in the commercial world. The …

The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays
an important role in real applications. In this paper, a new bio-inspired model is proposed to …

Whale optimization algorithm (WOA) is a recently proposed meta-heuristic algorithm which
imitates the hunting behavior of humpback whales. Due to its characteristic advantages, it …

This paper proposes a group theory-based optimization algorithm (GTOA) for knapsack
problems, which draws algebraic group operations into the evolution process. The key parts …

This paper first proposes a discrete differential evolution algorithm for discounted {0-1}
knapsack problems (D {0-1} KP) based on feasible solutions represented by the 0-1 vector …

The Harris hawks optimization algorithm (HHO) is a new swarm intelligence algorithm for
simulating the capture and attack of the hawks which has good global exploration and local …

While the classical knapsack problem has been the object to be solved by optimization
algorithm proposals for many years, another version of this problem, discounted {0-1} …

Abstract The Discounted {0-1} Knapsack P roblem (D {0-1} KP) is an extension of the
classical 0-1 knapsack problem (0-1 KP) that consists of selecting a set of item groups where …