Parallel algorithm for Bounded Knapsack Problem (Dmitry Vyukov)

The included code and solution write-up provides a parallel solution for the bounded knapsack problem, as described in the included problem description text file. The included write-up gives an overview of a dynamic programming algorithm to choose between possible solutions. In order to reduce the computational complexity, some preprocessing techniques are applied as described in the write-up. The parallelization of the dynamic programming portion of the algorithm was found to be untenable. However, the preprocessing steps offered enough independent work to make parallelization worthwhile. Intel Threading Building Blocks (TBB) is used for implementing the parallelism within the preprocessing tasks. The code was intended for Windows OS and includes Microsoft Visual Studio solution and project files to build the application.
DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.

Hay descargas disponibles bajo Creative Commons License license. Descargar ahora

Incluir en RSS: 

Para obtener más información sobre las optimizaciones del compilador, consulte el aviso sobre la optimización.