A combinatorial branch-and-bound algorithm for box search.
Quentin LouveauxSebastien MathieuPublished in: Discret. Optim. (2014)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- variable ordering
- search algorithm
- search space
- np hard
- optimal solution
- upper bound
- lower bounding
- combinatorial optimization
- lagrangian relaxation
- search tree
- single machine scheduling problem
- precedence constraints
- max sat
- search strategy
- mixed integer linear programming
- randomly generated problems
- test problems
- objective function
- cost function
- column generation
- lower and upper bounds
- reduce the search space
- search methods
- distance measure
- scheduling problem
- branch and bound method
- upper bounding