Exact and approximate USCP with branch and bound.
Janez RadescekMatjaz DepolliPublished in: GECCO Companion (2021)
Keyphrases
- branch and bound
- exact and approximate
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- upper bound
- column generation
- combinatorial optimization
- optimal solution
- branch and bound procedure
- branch and bound method
- branch and bound search
- beam search
- tree search algorithm
- randomly generated problems
- tree search
- np hard
- lagrangian heuristic
- network design problem
- max sat
- optimization problems
- search strategy
- machine learning
- database