A matheuristic for the 0-1 generalized quadratic multiple knapsack problem.
Yassine AdouaniBassem JarbouiMalek MasmoudiPublished in: Optim. Lett. (2022)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimization problems
- optimal solution
- test problems
- greedy algorithm
- dynamic programming
- multiple objectives
- objective function
- multidimensional knapsack problem
- maximum profit
- exact algorithms
- np hard problems
- implicit enumeration
- continuous relaxation
- np hard
- production planning
- linear programming relaxation
- bicriteria