The multidimensional 0–1 knapsack problem is one of the most well-known integer
programming problems and has received wide attention from the operational research …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

In this paper we present a heuristic based upon genetic algorithms for the multidimensional
knapsack problem. A heuristic operator which utilises problem-specific knowledge is …

Abstract The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model
that is one of the most well-known integer programming problems. During the last few …

The multiconstraint 0–1 knapsack problem is encountered when one has to decide how to
use a knapsack with multiple resource constraints. Even though the single constraint version …

In this article a new heuristic procedure is proposed. This procedure makes use of surrogate
duality in solving multiconstraint knapsack problems. Computational effort involved in the …

Abstract The 0–1 multidimensional knapsack problem (MKP) arises in many fields of
optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an …

Abstract The multidimensional 0–1 knapsack problem, defined as a knapsack with multiple
resource constraints, is well known to be much more difficult than the single constraint …

We present a family of knapsack problems (KPs) while highlighting their particular
applications. Though most of the problems are derived from the classical KP, the differences …

The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard
combinatorial optimization problem that can model a number of challenging applications in …