LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup.
Malek MasmoudiYassine AdouaniBassem JarbouiPublished in: Int. Trans. Oper. Res. (2024)
Keyphrases
- knapsack problem
- dynamic programming
- lp relaxation
- combinatorial optimization problems
- greedy algorithm
- exact algorithms
- optimization problems
- linear programming
- linear program
- np hard
- linear programming relaxation
- single machine scheduling problem
- production planning
- multistage
- metaheuristic
- optimal solution
- solution quality
- message passing
- stereo matching
- reinforcement learning
- infinite horizon
- cutting plane
- scheduling problem