Parallel time-space reduction by unbiased filtering for solving the 0/1-Knapsack problem.
Patcharin BuayenJeeraporn WerapunPublished in: J. Parallel Distributed Comput. (2018)
Keyphrases
- knapsack problem
- space reduction
- randomly generated test instances
- implicit enumeration
- optimal solution
- combinatorial optimization problems
- linear relaxation
- lp relaxation
- exact algorithms
- np hard
- optimization problems
- dynamic programming
- continuous relaxation
- greedy algorithm
- multidimensional knapsack problem
- greedy heuristic
- integer variables
- feature space
- linear programming relaxation
- bicriteria
- decision variables
- quadratic programming
- combinatorial optimization
- machine learning
- principal component analysis
- cutting plane
- linear program
- linear programming
- maximum profit