An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem.
Y.-J. SeongYoung-Gun GM.-K. KangC.-W. KangPublished in: J. Oper. Res. Soc. (2004)
Keyphrases
- branch and bound algorithm
- strongly correlated
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- optimal solution
- test problems
- randomly generated problems
- lower bounding
- combinatorial optimization
- single machine scheduling problem
- precedence constraints
- upper bounding
- mixed integer linear programming
- search tree
- branch and bound method
- max sat
- variable ordering
- search algorithm
- lagrangian relaxation
- metaheuristic
- special case
- search space
- integer variables
- traveling salesman problem