A branch-and-bound algorithm for hard multiple knapsack problems.
Alex S. FukunagaPublished in: Ann. Oper. Res. (2011)
Keyphrases
- branch and bound algorithm
- knapsack problem
- test problems
- optimal solution
- np hard
- lower bound
- branch and bound
- upper bound
- lower bounding
- integer variables
- combinatorial optimization
- upper bounding
- lagrangian relaxation
- precedence constraints
- finding an optimal solution
- combinatorial optimization problems
- max sat
- single machine scheduling problem
- variable ordering
- randomly generated problems
- branch and bound method
- optimization problems
- dynamic programming
- neural network