A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem.
Noé GodinhoLuís PaquetePublished in: SEA² (2019)
Keyphrases
- min max
- branch and bound
- lower bound
- branch and bound algorithm
- upper bound
- multiobjective optimization
- max min
- optimal solution
- search space
- column generation
- search algorithm
- spanning tree
- combinatorial optimization
- branch and bound method
- branch and bound procedure
- np hard
- randomly generated problems
- lower and upper bounds
- worst case
- tree search algorithm
- search strategies
- tree search
- network design problem
- objective function
- max sat
- lagrangian relaxation
- beam search
- depth first search
- partial solutions
- cutting plane
- linear programming relaxation
- branch and bound search
- probabilistic model
- multi objective