A parallel algorithm for the integer knapsack problem.
Domingo MoralesJosé L. RodaCasiano RodríguezFrancisco AlmeidaF. GarcíaPublished in: Concurr. Pract. Exp. (1996)
Keyphrases
- knapsack problem
- parallel algorithm
- integer variables
- decision variables
- continuous relaxation
- combinatorial optimization problems
- parallel computation
- optimal solution
- optimization problems
- np hard
- dynamic programming
- multidimensional knapsack problem
- parallel programming
- exact algorithms
- shared memory
- greedy algorithm
- maximum profit
- parallel version
- parallel implementations
- cluster of workstations
- linear programming relaxation
- medial axis transform
- binary search trees
- genetic algorithm
- randomly generated test instances
- vehicle routing problem
- branch and bound algorithm
- orders of magnitude
- upper bound
- cost function
- special case
- search space
- learning algorithm