Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for …
PC Chu, JE Beasley - Journal of heuristics, 1998 - Springer
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 …
A Fréville, SÏ Hanafi - Annals of Operations Research, 2005 - Springer
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 …
B Gavish, H Pirkul - Mathematical programming, 1985 - Springer
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 …
H Pirkul - Naval Research Logistics (NRL), 1987 - Wiley Online Library
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 …
A Freville, G Plateau - Discrete applied mathematics, 1994 - Elsevier
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 …
S Laabadi, M Naimi, H El Amri, B Achchab - American Journal of …, 2018 - scirp.org
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 …