Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
Christoph HertrichMartin SkutellaPublished in: INFORMS J. Comput. (2023)
Keyphrases
- knapsack problem
- optimal solution
- neural network
- multidimensional knapsack problem
- exact algorithms
- combinatorial optimization problems
- optimization problems
- dynamic programming
- test problems
- np hard
- multiple objectives
- linear programming relaxation
- integer variables
- greedy algorithm
- genetic algorithm
- implicit enumeration
- bi objective
- np hard problems
- solution quality
- bicriteria
- heuristic solution
- artificial neural networks
- maximum profit
- vehicle routing problem
- continuous relaxation
- column generation
- branch and bound
- lp relaxation
- objective function
- bayesian networks
- randomly generated test instances