Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem.
Túlio A. M. ToffoloTony WautersSam Van MalderenGreet Vanden BerghePublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- branch and bound
- lower bound
- tree decomposition
- upper bound
- branch and bound algorithm
- column generation
- randomly generated problems
- optimal solution
- linear programming relaxation
- search space
- lower and upper bounds
- tree search algorithm
- worst case
- search strategies
- np hard
- branch and bound procedure
- branch and bound method
- search algorithm
- network design problem
- max sat
- beam search
- tree search
- decomposition method
- objective function
- combinatorial optimization
- lagrangian relaxation
- branch and bound search
- partial solutions
- sat problem
- metaheuristic
- multi objective
- special case