Branch and bound for the cutwidth minimization problem.
Rafael MartíJuan José PantrigoAbraham DuarteEduardo G. PardoPublished in: Comput. Oper. Res. (2013)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- column generation
- optimal solution
- objective function
- upper bound
- search space
- combinatorial optimization
- tree search
- beam search
- branch and bound method
- tree search algorithm
- max sat
- branch and bound procedure
- randomly generated problems
- depth first search
- partial solutions
- branch and bound search
- search strategies
- linear programming relaxation
- optimization problems
- probabilistic model
- multi objective
- bnb adopt
- mini bucket
- lagrangian heuristic