A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems.
Kurt M. BretthauerBala ShettySiddhartha SyamPublished in: INFORMS J. Comput. (1995)
Keyphrases
- knapsack problem
- branch and bound algorithm
- integer variables
- optimal solution
- np hard
- objective function
- test problems
- lower bound
- branch and bound
- combinatorial optimization problems
- linear programming relaxation
- randomly generated problems
- exact algorithms
- optimization problems
- upper bound
- computational complexity
- dynamic programming
- upper bounding
- production planning
- precedence constraints
- lower bounding
- variable ordering
- approximation algorithms
- linear program
- greedy algorithm
- metaheuristic
- lagrangian relaxation
- solution quality
- single machine scheduling problem
- branch and bound method
- maximum profit
- column generation
- integer programming
- linear programming
- special case
- feasible solution
- scheduling problem
- search algorithm
- genetic algorithm
- neural network