On the Implementation and Assessment of several Divide & Conquer Matheuristic Strategies for the solution of the Knapsack Problem.
Fernando A. MoralesJairo A. MartínezPublished in: CoRR (2019)
Keyphrases
- knapsack problem
- optimal solution
- implicit enumeration
- combinatorial optimization problems
- heuristic solution
- test problems
- greedy heuristic
- dynamic programming
- linear programming relaxation
- decision variables
- cutting plane
- optimization problems
- exact algorithms
- multidimensional knapsack problem
- solution quality
- bicriteria
- np hard
- multiple objectives
- greedy algorithm
- mathematical model
- combinatorial optimization
- lp relaxation
- integer variables
- dna computing
- continuous relaxation
- neural network
- np hard problems
- integer programming
- ant colony optimization
- metaheuristic
- bayesian networks
- machine learning