The Multidimensional Knapsack Problem (MKP) represents an important model having numerous applications in combinatorial optimisation, decision-making and�...
Jul 11, 2014 � Abstract—The Multidimensional Knapsack Problem (MKP) represents an important model having numerous applications in combinatorial�...
The goal is to find a subset of items leading to the maximum total profit while respecting the capacity constraints. Even though the 0/1 MKP is well studied in�...
This paper addresses the possibility of solving the MKP using a GPU accelerated Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable�...
Solving the Multidimensional Knapsack Problem using a ... - dblp
dblp.org › rec › conf › cec › ZanJ14
Bibliographic details on Solving the Multidimensional Knapsack Problem using a CUDA accelerated PSO.
Pr�spevok poukazauje na možnosť využitia GPU ako platformy na riešenie MKP probl�mu pomocou algoritmu PSO. Cieľom je vyhodnotiť dosiahnut� v�kon plne�...
Solving the Multidimensional Knapsack Problem using a CUDA accelerated PSO � Multi-dimensional OFDMA scheduling in a wireless network with relay nodes.
and Jaros, J. (2014). Solving the Multidimensional Knapsack Problem using a. CUDA accelerated PSO. In IEEE Congress on Evolutionary Computation, CEC 2014�...
This paper proposes a parallel PSO framework to solve the sparse reconstruction problem based on Compute Unified Device Architecture (CUDA) platform on�...
This work presents a PSO implemention in CUDA architecture, aiming to speed up the algorithm on problems which has large amounts of data. PSO-GPU algorithm�...