A branch-and-bound algorithm for the quadratic multiple knapsack problem.
Krzysztof FleszarPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- knapsack problem
- branch and bound algorithm
- optimal solution
- test problems
- np hard
- lower bound
- integer variables
- combinatorial optimization problems
- branch and bound
- objective function
- exact algorithms
- linear programming relaxation
- lower bounding
- combinatorial optimization
- upper bound
- upper bounding
- optimization problems
- computational complexity
- precedence constraints
- lagrangian relaxation
- randomly generated problems
- max sat
- single machine scheduling problem
- dynamic programming
- mixed integer linear programming
- finding an optimal solution
- maximum profit
- combinatorial problems
- greedy algorithm
- feasible solution
- linear programming
- cutting plane
- integer programming
- approximation algorithms
- metaheuristic
- simulated annealing
- worst case
- bayesian networks