Comparing MPI and OpenMP implementations of the 0-1 Knapsack Problem.
Isabel DortaCoromoto LeónCasiano RodríguezPublished in: Scalable Comput. Pract. Exp. (2002)
Keyphrases
- knapsack problem
- shared memory
- high performance computing
- combinatorial optimization problems
- optimal solution
- dynamic programming
- parallel programming
- optimization problems
- parallel computing
- message passing interface
- parallel algorithm
- multidimensional knapsack problem
- np hard
- message passing
- heuristic solution
- bicriteria
- massively parallel
- linear programming relaxation
- general purpose
- exact algorithms
- parallel implementation
- linear programming
- continuous relaxation
- decision variables
- greedy heuristic
- greedy algorithm
- implicit enumeration
- distributed memory