In the paper, we compute some lower bounds on time of parallel solving of the subset sum
problem on a big number of processors by several versions of dynamic programming …

We present a highly scalable parallel solution for the Subset-Sum Problem on Graphics
Processing Units (GPUs) that substantially reduces the memory access by the device and …

We present BalsubLast, which is an improved balanced algorithm for the Subset-Sum
Problem that was designed to solve benchmarks that require the exhaustion of the search …

Being a significant construct in a wide range of combinatorial problems, the k-subset sum
problem (k-SSP) computes k-element subsets, out of an n-element set, satisfying a user …

Addressing the subset sum problem is relevant to study resource management problems
efficiently. In this paper, we study a new scheme to sample solutions for the subset sum …

Ultrasound acquisition is widespread in the biomedical field, due to its properties of low cost,
portability, and non-invasiveness for the patient. The processing and analysis of US signals …

Efficiently representing and generating combinations can allow the seamless visualization,
sampling, and evaluation of combinatorial architectures. In this paper, being relevant to …

In this paper we study the question of parallelization of a variant of Branch-and-Bound
method for solving of the subset sum problem which is a special case of the Boolean …

Aiming at the low utilization rate of intensive computing cores in large heterogeneous
clusters and the high complexity of collaborative computing between GPU and multi-core …

[ES] El problema de la mochila es un problema NP-Completo bien conocido, que, en sus
diferentes variantes, tiene un gran interés, tanto teórico como práctico, y ha sido sujeto de …