Generating combinations on the GPU and its application to the k-subset sum
Victor Parque · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2021
Efficiently representing and generating combinations can allow the seamless visualization, sampling, and evaluation of combinatorial architectures. In this paper, being relevant to tackle resource allocation problems ubiquitously, we address the subset sum problem by (1) using gradient-free optimization with a number-based representation of the combinatorial search space and by (2) generating combinations with minimal change order through parallel reductions in the GPU.