A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems.
Dominique QuadriÉric SoutifPierre TollaPublished in: SOFSEM (1) (2007)
Keyphrases
- integer variables
- knapsack problem
- branch and bound algorithm
- optimal solution
- test problems
- mixed integer linear programming
- lower bound
- np hard
- continuous relaxation
- branch and bound
- objective function
- combinatorial optimization problems
- linear programming relaxation
- finding an optimal solution
- upper bound
- dynamic programming
- optimization problems
- network design problem
- lower bounding
- single machine scheduling problem
- precedence constraints
- cutting plane
- combinatorial optimization
- max sat
- lagrangian relaxation
- production planning
- variable ordering
- greedy algorithm
- search algorithm
- exact algorithms
- linear programming
- randomly generated problems
- mathematical programming
- nsga ii
- branch and bound method