Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem.
Méziane AïderOussama GacemMhand HifiPublished in: J. Oper. Res. Soc. (2022)
Keyphrases
- knapsack problem
- computational complexity
- dynamic programming
- optimal solution
- np hard
- exact algorithms
- learning algorithm
- optimization problems
- objective function
- test problems
- solution quality
- worst case
- linear programming relaxation
- bicriteria
- implicit enumeration
- convex hull
- distance transform
- simulated annealing
- combinatorial optimization problems
- exact solution
- greedy heuristic