A Parallel Two-List Algorithm for the Knapsack Problem.
Der-Chyuan LouChin-Chen ChangPublished in: Parallel Comput. (1997)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- np hard
- parallel implementation
- greedy heuristic
- objective function
- combinatorial optimization problems
- optimization problems
- optimization algorithm
- learning algorithm
- particle swarm optimization
- neural network
- cutting plane
- exact algorithms
- lower and upper bounds
- np hard problems
- approximation algorithms
- greedy algorithm
- traveling salesman problem
- worst case
- search space
- computational complexity
- machine learning