Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
Christoph HertrichMartin SkutellaPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- optimal solution
- multidimensional knapsack problem
- neural network
- exact algorithms
- combinatorial optimization problems
- multiple objectives
- test problems
- dynamic programming
- np hard
- optimization problems
- bi objective
- integer variables
- linear programming relaxation
- continuous relaxation
- solution quality
- greedy algorithm
- artificial neural networks
- decision variables
- lp relaxation
- greedy heuristic
- computational complexity
- genetic algorithm
- implicit enumeration
- bicriteria
- np hard problems
- special case
- machine learning