The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem.
Dong X. ShawGeon ChoPublished in: Networks (1998)
Keyphrases
- branch and bound algorithm
- knapsack problem
- upper bound
- lower bound
- optimal solution
- maximum profit
- np hard
- branch and bound
- test problems
- upper bounding
- linear programming relaxation
- integer variables
- lower bounding
- combinatorial optimization problems
- dynamic programming
- optimization problems
- worst case
- precedence constraints
- single machine scheduling problem
- lower and upper bounds
- exact algorithms
- objective function
- randomly generated problems
- production planning
- greedy algorithm
- mixed integer linear programming
- lagrangian relaxation
- cutting plane
- tree nodes
- finding an optimal solution
- max sat
- special case
- implicit enumeration
- metaheuristic
- linear program
- integer programming
- randomly generated test instances