Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
Christoph HertrichMartin SkutellaPublished in: AAAI (2021)
Keyphrases
- knapsack problem
- optimal solution
- neural network
- multidimensional knapsack problem
- exact algorithms
- combinatorial optimization problems
- multiple objectives
- np hard
- optimization problems
- test problems
- integer variables
- bicriteria
- dynamic programming
- greedy algorithm
- genetic algorithm
- greedy heuristic
- linear programming relaxation
- solution quality
- randomly generated test instances
- np hard problems
- bi objective
- feasible solution
- benchmark problems
- branch and bound
- linear program
- worst case
- search algorithm
- heuristic solution
- search space
- artificial neural networks
- computational complexity
- continuous relaxation