Relaxations and heuristics for the multiple non-linear separable knapsack problem.
Claudia D'AmbrosioSilvano MartelloLuca MencarelliPublished in: Comput. Oper. Res. (2018)
Keyphrases
- knapsack problem
- exact algorithms
- linear programming relaxation
- np hard
- heuristic solution
- greedy heuristic
- optimal solution
- combinatorial optimization problems
- randomly generated test instances
- optimization problems
- test problems
- continuous relaxation
- dynamic programming
- lower bound
- search algorithm
- bicriteria
- multidimensional knapsack problem
- neural network
- decision variables
- objective function
- greedy algorithm
- heuristic methods
- special case
- lp relaxation
- reinforcement learning