An efficient data structure for branch-and-bound algorithm.
Wu JigangThambipillai SrikanthanPublished in: Inf. Sci. (2004)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- test problems
- lower bounding
- np hard
- combinatorial optimization
- search tree
- optimal solution
- precedence constraints
- randomly generated problems
- branch and bound method
- mixed integer linear programming
- single machine scheduling problem
- search algorithm
- max sat
- upper bounding
- integer variables
- finding an optimal solution
- maximum clique
- variable ordering
- lagrangian relaxation
- traveling salesman problem